Title :
The linear programming bound for binary linear codes
Author_Institution :
Dept. of Math. & Comput. Sci., Eindhoven Univ. of Technol., Netherlands
fDate :
3/1/1993 12:00:00 AM
Abstract :
Combining Delsarte´s (1973) linear programming bound with the information that certain weights cannot occur, new upper bounds for dmin (n,k), the maximum possible minimum distance of a binary linear code with given word length n and dimension k, are derived
Keywords :
error correction codes; linear programming; binary linear codes; linear programming bound; minimum distance; upper bounds; Computer science; Linear code; Linear programming; Mathematics; Table lookup; Upper bound; Vectors;
Journal_Title :
Information Theory, IEEE Transactions on
