A New Decoding Algorithm for Complete Decoding of Linear Block Codes

DOI10.1137/S0895480197323974MaRDI QIDQ4210232zbMATH OpenOpenAlexFDO

Authors Yunghsiang Sam Han

Publication date 21 September 1998

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480197323974

zbMATH Keywords

block codescodingdecodinglinear codes

Mathematics Subject Classification ID

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

Recommendations

• Decoding by generalized information sets
• Tables of coverings for decoding by \(S\)-sets
• A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm
• scientific article; zbMATH DE number 2077078
• The zero-guards algorithm for general minimum-distance decoding problems

Cited in

(10)

• Decoding complexity of linear block codes
• Decoding by generalized information sets
• Complexity of Elias algorithm based on codes with covering radius three
• scientific article; zbMATH DE number 3859037 (Why is no real title available?)
• A New Linear Programming Approach to Decoding Linear Block Codes
• A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm
• An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder
• The zero-guards algorithm for general minimum-distance decoding problems
• Complementary reliability-based decodings of binary linear block codes
• Tables of coverings for decoding by \(S\)-sets

This page was built for publication: A New Decoding Algorithm for Complete Decoding of Linear Block Codes

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