Successive cancellation decoding of Reed-Solomon codes

DOI10.1134/S0032946014040012zbMath1334.94105OpenAlexW1999067466MaRDI QIDQ2352633

P. V. Trifonov

Publication date: 3 July 2015

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946014040012

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Decoding (94B35)

Cites Work

• Unnamed Item
• List Decoding of Polar Codes
• Polar Codes for the $m$-User Multiple Access Channel
• Algebraic soft-decision decoding of reed-solomon codes
• Bit-level soft-decision decoding of Reed-Solomon codes
• Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part II: Soft-Input Soft-Output Iterative Decoding
• How to Construct Polar Codes
• New generalizations of the Reed-Muller codes--I: Primitive codes

This page was built for publication: Successive cancellation decoding of Reed-Solomon codes