Title :
Bounds on mixed binary/ternary codes
Author :
Brouwer, A.E. ; Hämäläinen, Heikki O. ; Östergård, Patric R J ; Sloane, N. J A
Author_Institution :
Dept. of Math., Eindhoven Univ. of Technol., Netherlands
fDate :
1/1/1998 12:00:00 AM
Abstract :
Upper and lower bounds are presented for the maximal possible size of mixed binary/ternary error-correcting codes. A table up to length 13 is included. The upper bounds are obtained by applying the linear programming bound to the product of two association schemes. The lower bounds arise from a number of different constructions
Keywords :
binary sequences; error correction codes; linear programming; association schemes; code length; error-correcting codes; linear programming bound; lower bounds; maximal possible code size; mixed binary/ternary codes; upper bounds; Binary codes; Computer science; Error correction codes; Hamming distance; Linear programming; Mathematics; Upper bound; Vectors;
Journal_Title :
Information Theory, IEEE Transactions on
