On the minimal redundancy of binary error-correcting codes

DOI10.1016/S0019-9958(75)90300-9zbMath0316.94007OpenAlexW2078407910MaRDI QIDQ4077874

Vladimir I. 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)

Related Items (2)

A new upper bound on nonbinary block codes ⋮ On the optimum of Delsarte's linear program

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