Low complexity soft-decision sequential decoding using hybrid permutation for Reed-Solomon codes

DOI10.1007/3-540-46665-7_18MaRDI QIDQ4945363zbMATH OpenFDO

Authors Min-Seok Oh, Peter F. Sweeney

Publication date 18 March 2002

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

Full work available at URL https://doi.org/10.1007/3-540-46665-7_18

zbMATH Keywords

cyclic permutationmodified Fano sequential algorithmReed-Solomon codessoft-decision decoding methodsquaring permutationtrellis construction

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combined modulation schemes (including trellis codes) in coding theory (94B12) Decoding (94B35)

Recommendations

• Symbol-level soft-decision decoding of Reed-Solomon codes
• Successive cancellation decoding of Reed-Solomon codes
• Bit-level soft-decision decoding of Reed-Solomon codes
• Some soft-decision decoding algorithms for Reed-Solomon codes
• An efficient soft-decision Reed-Solomon decoding algorithm

Cited in

(2)

• Sequential decoding for a subcode of Reed Solomon codes
• Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part II: Soft-Input Soft-Output Iterative Decoding

This page was built for publication: Low complexity soft-decision sequential decoding using hybrid permutation for Reed-Solomon codes

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