Complexity of decoding for linear codes

MaRDI QIDQ1056724zbMATH OpenFDO

Authors G. S. Evseev

Publication date 1983

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

complexity of decodingdecoding of binary linear codesQ-decoding

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35) Error probability in coding theory (94B70)

Cited in

(2)

• New approaches to reduced-complexity decoding
• On the complexity of suboptimal decoding for list and decision feedback schemes

This page was built for publication: Complexity of decoding for linear codes

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