Affordable Access

Lower bounds on the minimum average distance of binary codes

Authors
Publication Date
Source
Repository CWI Amsterdam
Keywords
  • Binary Codes
  • Minimum Average Distance
  • Linear Programming
External links

Abstract

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

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments
F