Author of the publication

Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations.

, and . IEEE Trans. Inf. Theory, 37 (6): 1716-1723 (1991)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On some classes of cyclic codes of composite length (Corresp.)., and . IEEE Trans. Inf. Theory, 19 (6): 820-823 (1973)On Quasi-Perfect Property of Double-Error-Correcting Goppa Codes and Their Complete Decoding, and . Inf. Control., 61 (2): 132-146 (May 1984)On Iterative Decoding of Bch Codes and Decoding Beyond the Bch Bound. University of Illinois Urbana-Champaign, USA, (1969)Generation of matrices for determining minimum distance and decoding of cyclic codes., , , and . IEEE Trans. Inf. Theory, 42 (2): 653-657 (1996)On the generalized Hamming weights of several classes of cyclic codes., , and . IEEE Trans. Inf. Theory, 38 (3): 1125-1130 (1992)Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations., and . IEEE Trans. Inf. Theory, 37 (6): 1716-1723 (1991)A bound for cyclic codes of composite length (Corresp.)., and . IEEE Trans. Inf. Theory, 18 (2): 307 (1972)An algorithm of complete decoding of double-error-correcting Goppa codes., and . AAECC, volume 228 of Lecture Notes in Computer Science, page 154-160. Springer, (1984)Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)., and . IEEE Trans. Inf. Theory, 20 (2): 292-295 (1974)Simplified understanding and efficient decoding of a class of algebraic-geometric codes., , , and . IEEE Trans. Inf. Theory, 40 (4): 981-1002 (1994)