Two approaches to the extension problem for arbitrary weights over finite module alphabets
From MaRDI portal
Publication:2043867
DOI10.1007/s00200-020-00465-5zbMath1494.94053OpenAlexW3093157741MaRDI QIDQ2043867
Publication date: 3 August 2021
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-020-00465-5
Linear codes (general theory) (94B05) Ordinary and skew polynomial rings and semigroup rings (16S36) Semigroup rings, multiplicative semigroups of rings (20M25)
Related Items (1)
Cites Work
- Two analogues of Maillet's determinant
- MacWilliams extension theorems and the local-global property for codes over Frobenius rings
- Weighted modules and representations of codes
- Finite-ring combinatorics and MacWilliams' equivalence theorem
- The extension theorem for the Lee and Euclidean weights over \(\mathbb{Z}/p^k \mathbb{Z}\)
- Characteristics of invariant weights related to code equivalence over rings
- 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
- Finite chain rings
- The Extension Theorem with Respect to Symmetrized Weight Compositions
- FOUNDATIONS OF LINEAR CODES DEFINED OVER FINITE MODULES: THE EXTENSION THEOREM AND THE MACWILLIAMS IDENTITIES
- Duality for modules over finite rings and applications to coding theory
- FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES
- The extension theorem for bi-invariant weights over Frobenius rings and Frobenius bimodules
- Characterization of finite Frobenius rings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Two approaches to the extension problem for arbitrary weights over finite module alphabets
