Determining the burst-correcting limit of cyclic codes
- 1 May 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 26 (3) , 289-297
- https://doi.org/10.1109/tit.1980.1056193
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Best Fire codes with length up to 1200 bits (Corresp.)IEEE Transactions on Information Theory, 1970
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969
- Optimum shortened cyclic codes for burst-error correctionIEEE Transactions on Information Theory, 1963
- A note on optimum burst-error-correcting codesIEEE Transactions on Information Theory, 1962