Bounds on mixed binary/ternary codes

Authors:
A. E. Brouwer;H. O. Hamalainen;P. R.J. Ostergard;N. J.A. Sloane
Affiliations:
Dept. of Math., Eindhoven Univ. of Technol.;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 8

A clique size bounding technique with application to non-linear codes

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Error-Correcting Codes over an Alphabet of Four Elements

Designs, Codes and Cryptography
On Binary/Ternary Error-Correcting Codes with Minimum Distance 4

AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On Senary Simplex Codes

AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
New Results on Codes with Covering Radius 1 and Minimum Distance 2

Designs, Codes and Cryptography
New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming

Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
Error correcting coding for a nonsymmetric ternary channel

IEEE Transactions on Information Theory
New parameters of subsets in polynomial association schemes

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	754.90

Visualization

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