New Upper Bounds on A(n,d)

Details New Upper Bounds on A(n,d) New Upper Bounds on A(n,d)

2005-08-24

arxiv.org/abs/cs/0508107v1

Computer Science

Information Theory

To appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-

Scientific paper

Upper bounds on the maximum number of codewords in a binary code of a given
length and minimum Hamming distance are considered. New bounds are derived by a
combination of linear programming and counting arguments. Some of these bounds
improve on the best known analytic bounds. Several new record bounds are
obtained for codes with small lengths.

Affiliated with

Also associated with

No associations

Rating

New Upper Bounds on A(n,d) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with New Upper Bounds on A(n,d), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Upper Bounds on A(n,d) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-268873