|
Problemy Peredachi Informatsii, 1980, Volume 16, Issue 2, Pages 40–51
(Mi ppi1440)
|
|
|
|
Coding Theory
On Error Burst Correction Using Binomial Codes
G. L. Tauglikh
Abstract:
Classes of binary cyclic and linear binomial codes are constructed. A simple decoding algorithm for linear binomial codes is considered; it is based on successive application of majority decoding algorithms for cyclic binomial codes. It is shown that linear binomial codes are not inferior in terms of their parameters to many known error-burst-correcting codes, with the exception of optimal codes.
Received: 10.04.1978 Revised: 03.05.1979
Citation:
G. L. Tauglikh, “On Error Burst Correction Using Binomial Codes”, Probl. Peredachi Inf., 16:2 (1980), 40–51; Problems Inform. Transmission, 16:2 (1980), 111–120
Linking options:
https://www.mathnet.ru/eng/ppi1440 https://www.mathnet.ru/eng/ppi/v16/i2/p40
|
Statistics & downloads: |
Abstract page: | 178 | Full-text PDF : | 81 |
|