Complexity of constructing codes with specified correction properties

MaRDI QIDQ1140596zbMATH OpenFDO

Authors V. Yu. Krachkovskij

Publication date 1979

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

Full work available at URL http://mathnet.ru/eng/ppi/v15/i1/p50

zbMATH Keywords

binary linear codeasymptotic bounds for the error probabilityForney boundGallager bound

Mathematics Subject Classification ID

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

Recommendations

• The complexity of error-correcting codes
• scientific article; zbMATH DE number 3559420
• A recursive approach to low complexity codes
• Publication:4886138
• Decoding complexity of linear block codes

Cited in

(2)

• scientific article; zbMATH DE number 3559420 (Why is no real title available?)
• The complexity of error-correcting codes

This page was built for publication: Complexity of constructing codes with specified correction properties

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