Bounds on mixed binary/ternary codes

Bounds on mixed binary/ternary codes

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 numb...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 1998-01, Vol.44 (1), p.140-161
Hauptverfasser: Brouwer, A.E., Hamalainen, H.O., Ostergard, P.R.J., Sloane, N.J.A.
Format: Artikel
Sprache:eng
Schlagworte:
Binary codes
Codes
Computer science
Error correction codes
Hamming distance
Information processing
Linear programming
Mathematical models
Mathematics
Upper bound
Vectors
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0018-9448
1557-9654
DOI:10.1109/18.651001