Bounds on the dimension of codes and subcodes with prescribed contraction index

DOI10.1016/0024-3795(90)90269-IzbMath0712.94015MaRDI QIDQ749512

Alexander Vardy, Jakov Snyders, Yair Be'ery

Publication date: 1990

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

linear codeHamming distancecontraction indexupper and lower bounds on the dimension of a proper subcode

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On the MacWilliams identities for linear codes
• The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
• An updated table of minimum-distance bounds for binary linear codes
• Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes
• Algebraically punctured cyclic codes
• On the uniqueness of the Golay codes
• A geometric approach to a class of cyclic codes
• A Bound for Error-Correcting Codes
• On a necessary condition for L-step orthogonalization of linear codes and its applications

This page was built for publication: Bounds on the dimension of codes and subcodes with prescribed contraction index