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

DOI10.1016/0024-3795(90)90269-IMaRDI QIDQ749512zbMATH OpenFDO

Authors Alexander Vardy, Jakov Snyders, Yair Be'ery

Publication date 1990

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

Full work available at URL https://doi.org/10.1016/0024-3795(90)90269-I

zbMATH Keywords

contraction indexHamming distancelinear codeupper and lower bounds on the dimension of a proper subcode

Mathematics Subject Classification ID

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

Recommendations

• On the dimension of subfield subcodes
• Subcodes and covering radius (Corresp.)
• scientific article; zbMATH DE number 774615
• Subgroup subcodes
• Bounds on the minimum support weights

Cites work

• A Bound for Error-Correcting Codes
• A geometric approach to a class of cyclic codes
• Algebraically punctured cyclic codes
• An updated table of minimum-distance bounds for binary linear codes
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes
• On a necessary condition for L-step orthogonalization of linear codes and its applications
• On the MacWilliams identities for linear codes
• On the uniqueness of the Golay codes
• The smallest length of binary 7-dimensional linear codes with prescribed minimum distance

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

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