Bounds for binary codes just outside the plotkin range

DOI10.1016/S0019-9958(80)90709-3MaRDI QIDQ3926488zbMATH OpenFDO

Authors Aimo Tietäväinen

Publication date 1980

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

zbMATH Keywords

upper boundsmaximum number of codewords

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited in

(4)

• Upper bounds for constant weight and Lee codes slightly outside the Plotkin range
• The Tietäväinen bound for spherical codes
• Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
• Small codes

This page was built for publication: Bounds for binary codes just outside the plotkin range

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