Comparison of Two Algorithms for Decoding Alternant Codes

Applicable Algebra in Engineering, Communications and Computing

Volumn 9, Issue 3, 1998, Pages 211-220

  Fitzpatrick, Patrick ^a   Jennings, Sylvia M ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b LONDON SOUTH BANK UNIVERSITY   (United Kingdom)

Author keywords

Berlekamp massey algorithm; Decoding alternant codes; Key equation

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECODING;

ALTERNANT DECODING; BERLEKAMP-MASSEY ALGORITHM;

POLYNOMIALS;

EID: 0032299732     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002000050103     Document Type: Review

References (6)

1. Blahut, R.E.: Theory and Practice of Error Control Coding. Reading, MA: Addison-Wesley 1983
2. Blahut, R.E.: Fast Algorithms for Digital Signal Processing. Reading, MA: Addison-Wesley 1985
3. Carter, G.D.: Aspects of local linear complexity, PhD Thesis, University of London 1989
4. Fitzpatrick, P.: On the key equation, IEEE Trans. Inf. Theory IT-41, (5), 1290-1302 (1995)
5. Massey, J.L.: Shift-register synthesis and BCH decoding, IEEE Trans. Inf. Theory IT-15, (1), 122-127 (1969)
6. Reed, I.S., Shih, M.T., Truong, T.K.: VLSI design of inverse-free Berlekamp-Massey algorithm, IEE Proc.-E, Computers and Digital Techniques 138, (5), 295-298 (1991)