On the minimal redundancy of binary error-correcting codes

DOI10.1016/S0019-9958(75)90300-9MaRDI QIDQ4077874zbMATH OpenOpenAlexFDO

Authors Vladimir Levenshtein

Publication date 1974

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(75)90300-9

zbMATH Keywords

lower boundsconstant weight binary codesfixed error-correcting capability

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(5)

• scientific article; zbMATH DE number 3788532 (Why is no real title available?)
• A new upper bound on nonbinary block codes
• On lower bounds for the redundancy of optimal codes
• On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.)
• On the optimum of Delsarte's linear program

This page was built for publication: On the minimal redundancy of binary error-correcting codes

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