A decoding procedure for multiple-error-correcting cyclic codes
- 1 April 1964
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 10 (2) , 134-138
- https://doi.org/10.1109/tit.1964.1053649
Abstract
A decoding procedure for multiple-error-correcting cyclic codes is described. This method is very simple in principle and the mechanization is easy for short codes with relatively high redundancy. Applications are made to the cyclic Golay code, the Bose-Chaudhuri(63, 45), (31, 16), (31, 11)codes and the(41, 21)cyclic codes. A block diagram for a decoder for the Golay code is shown.Keywords
This publication has 8 references indexed in Scilit:
- The use of information sets in decoding cyclic codesIEEE Transactions on Information Theory, 1962
- The Reduction of Redundancy in Solving Prime Implicant TablesIRE Transactions on Electronic Computers, 1962
- On the number of information symbols in Bose-Chaudhuri codesInformation and Control, 1962
- On a program for Ray-Chaudhuri's algorithm for a minimum cover of an abstract complexCommunications of the ACM, 1961
- Error correcting codes and their implementation for data transmission systemsIEEE Transactions on Information Theory, 1961
- Linear-Input LogicIEEE Transactions on Electronic Computers, 1961
- Encoding and error-correction procedures for the Bose-Chaudhuri codesIEEE Transactions on Information Theory, 1960
- On decoding linear error-correcting codes--IIEEE Transactions on Information Theory, 1960