To the metrical rigidity of binary codes

DOI10.1023/A:1025148221096MaRDI QIDQ2487088zbMATH OpenOpenAlexFDO

Authors Sergey Avgustinovich, Faina I. Solov'eva

Publication date 17 August 2005

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

Full work available at URL https://doi.org/10.1023/a:1025148221096

zbMATH Keywords

binary codesmetrical rigidity

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial codes (94B25)

Recommendations

• On the metrical rigidity of binary codes
• On metric rigidity for some classes of codes
• scientific article; zbMATH DE number 1498828
• Square designs on new binary \(\left(\frac{3^n-1}{2}, \frac{3^n-1}{2}, 2.3^{n-2}\right)\) codes
• scientific article; zbMATH DE number 637359

Cited in

(8)

• Isometry groups of combinatorial codes
• On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code
• On the metrical rigidity of binary codes
• scientific article; zbMATH DE number 1811346 (Why is no real title available?)
• scientific article; zbMATH DE number 1498828 (Why is no real title available?)
• Isometry groups of combinatorial codes
• MacWilliams extension theorem for MDS codes over a vector space alphabet
• On perfect binary codes

This page was built for publication: To the metrical rigidity of binary codes

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