On the extendability of code isometries
From MaRDI portal
Recommendations
Cites work
- A Covering Theorem for Abelian Groups
- An Inequality for Tactical Configurations
- scientific article; zbMATH DE number 3817578 (Why is no real title available?)
- scientific article; zbMATH DE number 3664952 (Why is no real title available?)
- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- scientific article; zbMATH DE number 3525849 (Why is no real title available?)
- scientific article; zbMATH DE number 572473 (Why is no real title available?)
- scientific article; zbMATH DE number 686998 (Why is no real title available?)
- scientific article; zbMATH DE number 3054152 (Why is no real title available?)
- Isometric embedding in products of complete graphs
- On the concept of code-isomorphy
- Rook domains, Latin squares, affine planes, and error-distributing codes
Cited in
(13)- Geometric approach to the MacWilliams extension theorem for codes over module alphabets
- Isometry groups of combinatorial codes
- Werner Heise (1944--2013)
- On the metrical rigidity of binary codes
- scientific article; zbMATH DE number 1498828 (Why is no real title available?)
- Isometry groups of additive codes over finite fields
- Isometry groups of combinatorial codes
- MacWilliams extension theorem for MDS codes over a vector space alphabet
- On perfect binary codes
- Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances
- On weak isometries of preparata codes
- On metric rigidity for some classes of codes
- Isometric embeddings of \({\mathbb Z}_{p^k}\) in the Hamming space \({\mathbb F}_{p}^{N}\) and \({\mathbb Z}_{p^k}\)-linear codes
This page was built for publication: On the extendability of code isometries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1385209)
