Journal article
New binary codes
IEEE transactions on information theory, Vol.18(4), pp.503-510
07/1972
DOI: 10.1109/TIT.1972.1054833
Abstract
In this paper constructions are given for combining two, three, or four codes to obtain new codes. The Andryanov-Saskovets construction is generalized. It is shown that the Preparata double-error-correcting codes may be extended by about (block length) ^{1/2} symbols, of which only one is a check symbol, and that e -error-correcting BCH codes may sometimes be extended by (block !ength) ^{1/e} symbols, of which only one is a check symbol. Several new families of linear and nonlinear double-error-correcting codes are obtained. Finally, an infinite family of linear codes is given with d/n = \frac{1}{3} , the first three being the (24,2^12, 8) Golay code, a (48,2^15, 16) code, and a (96,2^18, 32) code. Most of the codes given have more codewords than any comparable code previously known to us.
Details
- Title: Subtitle
- New binary codes
- Creators
- N SloaneS Reddy - University of IowaChin-Long Chen
- Resource Type
- Journal article
- Publication Details
- IEEE transactions on information theory, Vol.18(4), pp.503-510
- Publisher
- IEEE
- DOI
- 10.1109/TIT.1972.1054833
- ISSN
- 0018-9448
- eISSN
- 1557-9654
- Language
- English
- Date published
- 07/1972
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984197322402771
Metrics
11 Record Views