A class of binary recurrent codes with limited error propagation
- 1 January 1967
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 13 (1), 106-113
- https://doi.org/10.1109/tit.1967.1053951
Abstract
A class of binary recurrent codes for correcting independent errors is given which has guaranteed error-limiting properties. These codes can be simply decoded using threshold decoding, and will recover from any decoding error caused by either an uncorrectable transmission error or a temporary malfunction of the encoder or decoder. A number of such codes are given along with a synthesis procedure. The results of a computer simulation are given which indicate that these codes perform better in some situations than other codes using threshold decoding.Keywords
This publication has 7 references indexed in Scilit:
- Application of Lyapunov's direct method to the error-propagation effect in convolutional codes (Corresp.)IEEE Transactions on Information Theory, 1964
- Analysis of recurrent codesIEEE Transactions on Information Theory, 1963
- THRESHOLD DECODINGPublished by Defense Technical Information Center (DTIC) ,1963
- Statistics of Hyperbolic Error Distributions in Data TransmissionIEEE Transactions on Communications, 1961
- Recurrent Codes: Easily Mechanized, Burst-Correcting, Binary CodesBell System Technical Journal, 1959
- A Survey of Difference SetsProceedings of the American Mathematical Society, 1956
- A Theorem in Finite Projective Geometry and Some Applications to Number TheoryTransactions of the American Mathematical Society, 1938