A unifying system-theoretic framework for errors-and-erasures Reed-Solomon decoding

DOI10.1007/3-540-45624-4_36MaRDI QIDQ4474270zbMATH OpenFDO

Authors Marten van Dijk, Henk D. L. Hollmann, Job C. Oostveen, Margreta Kuijper

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2227/22270343.htm

Mathematics Subject Classification ID

Social and behavioral sciences: general topics (91C99) Cyclic codes (94B15) Decoding (94B35)

Recommendations

• On decoding algorithms for generalized Reed-Solomon codes with errors and erasures
• On the decoder error probability for Reed - Solomon codes (Corresp.)
• Decoding of Reed Solomon codes beyond the error-correction bound
• On the Probability of Undetected Error for Overextended Reed–Solomon Codes
• Coding and Cryptography
• On the undetected error probability of binary expansions of Reed-Solomon codes
• On decoding algorithms for generalized Reed-Solomon codes with errors and erasures. II
• Inversionless decoding of both errors and erasures of Reed-Solomon code
• On decoding of both errors and erasures of a Reed-Solomon code using an inverse-free Berlekamp-Massey algorithm
• Reed–Muller Codes for Random Erasures and Errors

Cited in

(3)

• The non-gap sequence of a subcode of a generalized Reed-Solomon code
• State representations of convolutional codes over a finite ring
• Composite scheme LR+Th for decoding with erasures and its effective equivalence to Forney's rule

This page was built for publication: A unifying system-theoretic framework for errors-and-erasures Reed-Solomon decoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474270)