Bounds on mixed binary/ternary codes

A.E. Brouwer, H.O. Hämäläinen, P.R.J. Ostergård, N.J.A. Sloane

Research output: Contribution to journalArticleAcademicpeer-review

43 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)140-161
JournalIEEE Transactions on Information Theory
Volume44
Issue number1
DOIs
Publication statusPublished - 1998

Fingerprint

Linear programming
programming

Cite this

Brouwer, A. E., Hämäläinen, H. O., Ostergård, P. R. J., & Sloane, N. J. A. (1998). Bounds on mixed binary/ternary codes. IEEE Transactions on Information Theory, 44(1), 140-161. https://doi.org/10.1109/18.651001
Brouwer, A.E. ; Hämäläinen, H.O. ; Ostergård, P.R.J. ; Sloane, N.J.A. / Bounds on mixed binary/ternary codes. In: IEEE Transactions on Information Theory. 1998 ; Vol. 44, No. 1. pp. 140-161.
@article{9bcd83404c2d421fb85b605ddedaaf2c,
title = "Bounds on mixed binary/ternary codes",
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.",
author = "A.E. Brouwer and H.O. H{\"a}m{\"a}l{\"a}inen and P.R.J. Osterg{\aa}rd and N.J.A. Sloane",
year = "1998",
doi = "10.1109/18.651001",
language = "English",
volume = "44",
pages = "140--161",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers",
number = "1",

}

Brouwer, AE, Hämäläinen, HO, Ostergård, PRJ & Sloane, NJA 1998, 'Bounds on mixed binary/ternary codes', IEEE Transactions on Information Theory, vol. 44, no. 1, pp. 140-161. https://doi.org/10.1109/18.651001

Bounds on mixed binary/ternary codes. / Brouwer, A.E.; Hämäläinen, H.O.; Ostergård, P.R.J.; Sloane, N.J.A.

In: IEEE Transactions on Information Theory, Vol. 44, No. 1, 1998, p. 140-161.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Bounds on mixed binary/ternary codes

AU - Brouwer, A.E.

AU - Hämäläinen, H.O.

AU - Ostergård, P.R.J.

AU - Sloane, N.J.A.

PY - 1998

Y1 - 1998

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

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

U2 - 10.1109/18.651001

DO - 10.1109/18.651001

M3 - Article

VL - 44

SP - 140

EP - 161

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 1

ER -