Some results in decoding of certain maximal-distance and BCH codes
- 30 April 1972
- journal article
- Published by Elsevier in Information and Control
- Vol. 20 (3) , 232-243
- https://doi.org/10.1016/s0019-9958(72)90415-9
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On decoding of Reed-Solomon codesIEEE Transactions on Information Theory, 1971
- Some asymptotically optimal burst-correcting codes and their relation to single-error-correcting Reed-Solomon codesIEEE Transactions on Information Theory, 1971
- On Binary Cyclic Codes Which are Also Cyclic Codes Over $GF(2^s )$SIAM Journal on Applied Mathematics, 1970
- On efficient burst correcting residue polynomial codesInformation and Control, 1970
- Hybrid methods for finding roots of a polynomial - With application to BCH decoding (Corresp.)IEEE Transactions on Information Theory, 1969
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969
- Redundant residue polynomial codesInformation and Control, 1968
- On the solution of algebraic equations over finite fieldsInformation and Control, 1967
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codesIEEE Transactions on Information Theory, 1964
- The Theory of Autonomous Linear Sequential NetworksIRE Transactions on Circuit Theory, 1959