MacWilliams' extension theorem for rank-metric codes
From MaRDI portal
Publication:6184181
DOI10.1016/j.jsc.2023.102263arXiv2304.13341OpenAlexW4386374896MaRDI QIDQ6184181
Publication date: 5 January 2024
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2304.13341
Cites Work
- Unnamed Item
- Unnamed Item
- Algebraic structures of MRD codes
- MacWilliams extension theorems and the local-global property for codes over Frobenius rings
- The extension theorem for the Lee and Euclidean weights over \(\mathbb{Z}/p^k \mathbb{Z}\)
- The extension theorem for Lee and Euclidean weight codes over integer residue rings
- MacWilliams' extension theorem for bi-invariant weights over finite principal ideal rings
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- An elementary proof of the MacWilliams theorem on equivalence of codes
- Duality for modules over finite rings and applications to coding theory
- MacWilliams’ extension theorem for infinite rings
- Rank-metric codes
This page was built for publication: MacWilliams' extension theorem for rank-metric codes