On metric rigidity for some classes of codes

DOI10.1134/S0032946011010029zbMath1241.94031OpenAlexW2049577884MaRDI QIDQ764247

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)

Related Items

Isometry groups of combinatorial codes ⋮ MacWilliams extension theorem for MDS codes over a vector space alphabet ⋮ Isometry groups of combinatorial codes ⋮ On extendability of additive code isometries

Cites Work

• On the extendability of code isometries
• Unnamed Item
• Unnamed Item
• Unnamed Item