Performance Bounds for Nonbinary Linear Block Codes Over Memoryless Symmetric Channels

DOI10.1109/TIT.2008.2011443zbMATH Open1367.94370MaRDI QIDQ4975754FDOQ4975754

Authors: Eran Hof, Igal Sason, S. Shamai Edit this on Wikidata

Publication date: 8 August 2017

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

Recommendations

• Parity-check density versus performance of binary linear block codes over memoryless symmetric channels
• Tight Performance Bounds for Permutation Invariant Binary Linear Block Codes Over Symmetric Channels
• Bounds on the achievable rates of block coding for a memoryless multiple-access channel
• Performance bounds for high rate linear codes over partial-response channels
• On the undetected error probability of linear block codes on channels with memory
• Performance Bounds for Erasure, List, and Decision Feedback Schemes With Linear Block Codes
• Explicit rateless codes for memoryless binary-input output-symmetric channels
• scientific article; zbMATH DE number 3412515
• scientific article; zbMATH DE number 4039791
• Performance bounds and optimal linear coding for discrete-time multichannel communication systems (Corresp.)

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Linear codes (general theory) (94B05) Channel models (including quantum) in information and communication theory (94A40)

This page was built for publication: Performance Bounds for Nonbinary Linear Block Codes Over Memoryless Symmetric Channels

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