Error-correcting codes over an alphabet of four elements

Citation
Gt. Bogdanova et al., Error-correcting codes over an alphabet of four elements, DES CODES C, 23(3), 2001, pp. 333-342
Citations number
28
Categorie Soggetti
Computer Science & Engineering
Journal title
DESIGNS CODES AND CRYPTOGRAPHY
ISSN journal
09251022 → ACNP
Volume
23
Issue
3
Year of publication
2001
Pages
333 - 342
Database
ISI
SICI code
0925-1022(2001)23:3<333:ECOAAO>2.0.ZU;2-E
Abstract
The problem of finding the values of A(q)(n,d)-the maximum size of a code o f length n and minimum distance d over an alphabet of q elements-is conside red. Upper and lower bounds on A(4)(n,d) are presented and some values of t his function are settled. A table of best known bounds on A(4)(n,d) is give n for n less than or equal to 12. When q less than or equal to M < 2q, all parameters for which A(q)(n,d) = M are determined.