On Error Burst Correction Using Binomial Codes

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.