BOUNDS ON MIXED BINARY TERNARY CODES

Authors
BROUWER AE HAMALAINEN HO OSTERGARD PRJ SLOANE NJA
Citation
Ae. Brouwer et al., BOUNDS ON MIXED BINARY TERNARY CODES, IEEE transactions on information theory, 44(1), 1998, pp. 140-161
Citations number
42
Categorie Soggetti
Computer Science Information Systems","Engineering, Eletrical & Electronic","Computer Science Information Systems
Journal title
IEEE transactions on information theory → ACNP
ISSN journal
00189448
Volume
44
Issue
1
Year of publication
1998
Pages
140 - 161
Database
ISI
SICI code
0018-9448(1998)44:1<140:BOMBTC>2.0.ZU;2-S
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 i s included, The upper bounds are obtained by applying the linear progr amming bound to the product of two association schemes. The lower boun ds arise from a number of different constructions.