On the complexity of minimum distance decoding of long linear codes

DOI10.1109/18.771141MaRDI QIDQ4701401zbMATH OpenOpenAlexFDO

Authors Alexander Barg, Evgueni Krouk, Henk van Tilborg

Publication date 21 November 1999

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

Full work available at URL https://semanticscholar.org/paper/0d34465f08a3dd2708854d686f412a5b90aa3e24

zbMATH Keywords

error probabilitydecoding algorithm\(q\)-ary linear codescovering-set decodingminimum-distance decodingsplit syndrome decodingsupercode decoding

Mathematics Subject Classification ID

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

Cited in

(10)

• Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance
• Lower bounds on the minimum distance of long codes in the Lee metric
• scientific article; zbMATH DE number 2077078 (Why is no real title available?)
• Generalization of the ball-collision algorithm
• A commutative algebra approach to linear codes
• On the complexity of suboptimal decoding for list and decision feedback schemes
• LDPC codes from Singer cycles
• Integer SEC-DED codes for low power communications
• Key masking using biometry
• Decoding complexity of linear block codes

This page was built for publication: On the complexity of minimum distance decoding of long linear codes

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