Lower bounds on the minimum average distance of binary codes

Details Lower bounds on the minimum average distance of binary codes Lower bounds on the minimum average distance of binary codes

2007-06-22

arxiv.org/abs/0706.3295v1

Computer Science

Information Theory

19 pages

Scientific paper

New lower bounds on the minimum average Hamming distance of binary codes are
derived. The bounds are obtained using linear programming approach.

Affiliated with

Also associated with

No associations

Rating

Lower bounds on the minimum average distance of binary codes 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 Lower bounds on the minimum average distance of binary codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower bounds on the minimum average distance of binary codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-187720