Upper bounds on the cardinality of a binary code with a given minimum distance

DOI10.1016/S0019-9958(75)90310-1zbMath0315.94006OpenAlexW1986045152MaRDI QIDQ4077177

V. M. Sidel'nikov

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)90310-1

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items (4)

Upper bounds for constant weight and Lee codes slightly outside the Plotkin range ⋮ Maximal orthoplectic fusion frames from mutually unbiased bases and block designs ⋮ A new upper bound on nonbinary block codes ⋮ On upper bounds for code distance and covering radius of designs in polynomial metric spaces

This page was built for publication: Upper bounds on the cardinality of a binary code with a given minimum distance