On metric rigidity for some classes of codes

DOI10.1134/S0032946011010029MaRDI QIDQ764247zbMATH OpenOpenAlexFDO

Authors D. I. Kovalevskaya

Publication date 13 March 2012

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0032946011010029

zbMATH Keywords

equidistant codesmetric rigidityaffine resolvable designs

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Recommendations

• scientific article; zbMATH DE number 1498828
• scientific article; zbMATH DE number 1811346
• On the metrical rigidity of binary codes
• On the extendability of code isometries
• On isometry of close-packed binary codes

Cites work

• scientific article; zbMATH DE number 3771617 (Why is no real title available?)
• scientific article; zbMATH DE number 3438734 (Why is no real title available?)
• scientific article; zbMATH DE number 3023391 (Why is no real title available?)
• On the extendability of code isometries

Cited in

(8)

• On the extendability of code isometries
• On linear rigidity of a class of codes
• Isometry groups of combinatorial codes
• Bounds for Robust Metering Schemes and Their Relationship with A2-code
• To the metrical rigidity of binary codes
• Isometry groups of combinatorial codes
• On the metrical rigidity of binary codes
• MacWilliams extension theorem for MDS codes over a vector space alphabet

This page was built for publication: On metric rigidity for some classes of codes

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