A simple one-sweep algorithm for optimal APP symbol decoding of linear block codes

DOI10.1109/18.737541MaRDI QIDQ4701236zbMATH OpenOpenAlexFDO

Authors Thomas Johansson, Kamil S. Zigangirov

Publication date 21 November 1999

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://lup.lub.lu.se/record/1157125

zbMATH Keywords

linear block codestrellissoft-output symbol decoding

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35) Modulation and demodulation in information and communication theory (94A14) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• scientific article; zbMATH DE number 3859037
• Decoding linear block codes using a priority-first search: performance analysis and suboptimal version
• scientific article; zbMATH DE number 3963726
• scientific article; zbMATH DE number 1135091

Cited in

(4)

• Symbol-by-symbol decoding as an approximation of word-by-word decoding
• SCA-LDPC: a code-based framework for key-recovery side-channel attacks on post-quantum encryption schemes
• Symbol-by-symbol APP decoding of the Golay code and iterative decoding of concatenated Golay codes
• Soft-Output BEAST Decoding With Application to Product Codes

This page was built for publication: A simple one-sweep algorithm for optimal APP symbol decoding of linear block codes

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