Some asymptotically optimal burst-correcting codes and their relation to single-error-correcting Reed-Solomon codes
- 1 January 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 17 (1) , 92-95
- https://doi.org/10.1109/tit.1971.1054581
Abstract
A class of asymptotically optimal burst-correcting codes that are closely related to the Fire codes is defined. The codes are quasi-cyclic as defined by Townsend and Weldon. However, decoding can be accomplished with a very simple algorithm similar to that used for cyclic burst-correcting codes. It is shown that these codes are equivalent to certain Reed-Solomon codes. From this it follows that such Reed-Solomon codes can be easily encoded and decoded without any computations in an extension field.Keywords
This publication has 2 references indexed in Scilit:
- Polynomial Codes Over Certain Finite FieldsJournal of the Society for Industrial and Applied Mathematics, 1960
- Codes for the correction of 'clustered' errorsIEEE Transactions on Information Theory, 1960