Error-Erasure Decoding of Binary Cyclic Codes, Up to a Particular Instance of the Hartmann-Tzeng Bound

IEEE Transactions on Information Theory

Volumn 36, Issue 5, 1990, Pages 1144-1149

  Stevens, Patrick ^a  

^a Generate Bank Department of Information Services ^*  (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODING; CYCLIC CODING; ERROR ERASURE DECODING; HARTMANN-TZENG BOUND;

CODES, SYMBOLIC;

EID: 0025483480     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.57215     Document Type: Article

References (4)

1. G. D. Forney, Jr., “On decoding BCH codes,” IEEE Trans. Inform. Theory, vol. IT-11, no. 4, pp. 549–557, Oct. 1965.
2. P. Stevens, “Extensions of the BCH algorithm in order to decode binary cyclic codes up to their maximum error correction capacities,” IEEE Trans. Inform. Theory, vol. IT-34, no. 5, pp. 1332–1340, Sept. 1988.
3. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North Holland, 1977.
4. C. R. P. Hartmann and K. K. Tzeng “Generalizations of the BCH bound,” Inform. Contr., vol. 20, pp. 489–498, 1972.