Bit loss and gain correction code
- 1 January 1962
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 8 (1) , 35-38
- https://doi.org/10.1109/tit.1962.1057684
Abstract
A block code is presented that will correct an error consisting of the gain or loss of a bit (binary digit) within the block. The code can be generalized to correct the loss or gain of a burst of bits. A further feature is the possibility of correcting additive errors appearing in the vicinity of the bit loss or gain. An additive error is a bit changed from 0 to 1 or from 1 to 0. The code is constructed by inserting a known character into a burst-error-correcting code at periodic intervals. The known character locates the approximate position of the bit loss or gain. At the location a bit is inserted or removed from the block, depending on whether a loss or a gain has occurred. The error-correcting code then corrects the erroneous bits between where the error occurred and where the correction took place.Keywords
This publication has 3 references indexed in Scilit:
- Digital Data Communication TechniquesProceedings of the IRE, 1961
- Synchronization of binary messagesIEEE Transactions on Information Theory, 1960
- Recurrent Codes: Easily Mechanized, Burst-Correcting, Binary CodesBell System Technical Journal, 1959