Optimal information bit decoding of linear block codes

DOI10.1109/18.370113MaRDI QIDQ4840877zbMATH OpenOpenAlexFDO

Authors Aaron B. Kiely, John T. Coffey, Mark R. Bell

Publication date 6 November 1995

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

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

zbMATH Keywords

error probabilitiesoptimal decodinglinear block code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• On the complete decoding of binary linear codes (Corresp.)
• Encoding and decoding for the minimization of message symbol error rates in linear block codes
• scientific article; zbMATH DE number 493106
• scientific article; zbMATH DE number 4150087
• Decoding by local optimization (Corresp.)

Cited in

(6)

• On the complete decoding of binary linear codes (Corresp.)
• Decoding by local optimization (Corresp.)
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• Partial-optimal piecewise decoding of linear codes
• scientific article; zbMATH DE number 493106 (Why is no real title available?)
• Encoding and decoding for the minimization of message symbol error rates in linear block codes

This page was built for publication: Optimal information bit decoding of linear block codes

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