On the minimal redundancy of binary error-correcting codes

DOI10.1016/S0019-9958(75)90300-9zbMATH Open0316.94007OpenAlexW2078407910MaRDI QIDQ4077874FDOQ4077874

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)

• 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
• Title not available (Why is that?)

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)