Augmentation techniques for a class of product codes
- 1 September 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 19 (5) , 666-672
- https://doi.org/10.1109/tit.1973.1055084
Abstract
A class of product codes for which an augmented syndrome can be defined is studied. By using this augmented syndrome, we are able to add new codewords to a product code while keeping the minimum distance fixed. In many cases the resulting code is as good as any known code. Decoders that may be simpler to implement than existing decoders are described for these augmented codes. It is also seen that in certain cases, by choosing not to correct a small number of correctable errors, significant simplifications in the decoder can be achieved. Finally, this augmentation technique is used in an example to generate a code of length 32 and minimum distance 8 with more codewords than any code previously known.Keywords
This publication has 14 references indexed in Scilit:
- A survey of constructive coding theory, and a table of binary codes of highest known rateDiscrete Mathematics, 1972
- New binary codesIEEE Transactions on Information Theory, 1972
- Decoding binary block codes onQ-ary output channelsIEEE Transactions on Information Theory, 1971
- New family of single-error correcting codesIEEE Transactions on Information Theory, 1970
- On decoding iterated codesIEEE Transactions on Information Theory, 1970
- On the uniqueness of the Golay codesJournal of Combinatorial Theory, 1968
- An optimum nonlinear codeInformation and Control, 1967
- Self-orthogonal quasi-cyclic codesIEEE Transactions on Information Theory, 1967
- A class of multiple-error-correcting codes and the decoding schemeTransactions of the IRE Professional Group on Information Theory, 1954
- Error Detecting and Error Correcting CodesBell System Technical Journal, 1950