On the concept of code-isomorphy
This paper deals with the error correcting coding isomorphism for block codes. Using the Hamming metric, one defines isometry, for the original code, for any permutation of the code and its configuration map. Also by transmitting the code for a symmetric channel, it comes to a conclusion as it is started as the symbol decoding failure probability does not depend on the transmitted symbol or on the time of transmission if the configuration group and the automorphism group act transitively on the set of codewords response on the set of the \(k\) information positions.
- On the extendability of code isometries
- Geometric approach to the MacWilliams extension theorem for codes over module alphabets
- Isometry groups of combinatorial codes
- Characteristics of invariant weights related to code equivalence over rings
- Relative one-weight linear codes
- The group of permutation automorphisms of a q-ary Hamming code
- Werner Heise (1944--2013)
- Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes. I
- Isometry groups of combinatorial codes
- MacWilliams extension theorem for MDS codes over a vector space alphabet
- scientific article; zbMATH DE number 971755 (Why is no real title available?)
- When the extension property does not hold
- 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 concept of code-isomorphy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563491)
