Invariance Properties of Binary Linear Codes Over a Memoryless Channel With Discrete Input

DOI10.1109/TIT.2006.890719zbMATH Open1310.94182OpenAlexW2162308753MaRDI QIDQ3548855FDOQ3548855

Authors: Ali Abedi, A. K. Khandani 

Publication date: 21 December 2008

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

Full work available at URL: https://doi.org/10.1109/tit.2006.890719

Recommendations

• Parity-check density versus performance of binary linear block codes over memoryless symmetric channels
• An Algorithm for Calculating the Exact Bit Error Probability of a Binary Linear Code Over the Binary Symmetric Channel
• On two probabilistic decoding algorithms for binary linear codes
• scientific article; zbMATH DE number 4039791
• scientific article; zbMATH DE number 3412515

Mathematics Subject Classification ID

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

Cited In (1)

• A new method for performance evaluation of bit decoding algorithms using statistics of the log likelihood ratio

This page was built for publication: Invariance Properties of Binary Linear Codes Over a Memoryless Channel With Discrete Input

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