scientific article; zbMATH DE number 2077103
From MaRDI portal
Publication:4470484
zbMATH Open1043.94541MaRDI QIDQ4470484FDOQ4470484
Authors: Jay A. Wood 
Publication date: 1 July 2004
Title of this publication is not available (Why is that?)
Recommendations
- FOUNDATIONS OF LINEAR CODES DEFINED OVER FINITE MODULES: THE EXTENSION THEOREM AND THE MACWILLIAMS IDENTITIES
- MacWilliams extension property for arbitrary weights on linear codes over module alphabets
- scientific article; zbMATH DE number 1932956
- Some generalizations of extension theorems for linear codes over finite fields
- MacWilliams extension theorems and the local-global property for codes over Frobenius rings
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Structure of finite commutative rings (13M05) Linear codes (general theory) (94B05)
Cited In (25)
- MacWilliams extension property for arbitrary weights on linear codes over module alphabets
- Partitions of Frobenius rings induced by the homogeneous weight
- MacWilliams extension theorems and the local-global property for codes over Frobenius rings
- On modules with cyclic socle
- \((l,s)\)-extension of linear codes
- Title not available (Why is that?)
- The extension problem for Lee and Euclidean weights
- Finite-ring combinatorics and MacWilliams' equivalence theorem
- Some constacyclic codes over finite chain rings
- MacWilliams' extension theorem for rank-metric codes
- A generalized extension theorem for linear codes
- The extension theorem with respect to symmetrized weight compositions
- On the weight distribution of codes over finite rings
- Two approaches to the extension problem for arbitrary weights over finite module alphabets
- MacWilliams' extension theorem for bi-invariant weights over finite principal ideal rings
- Linearly representable codes over chain rings
- On the equivalence of codes over rings and modules
- The structure of linear codes of constant weight
- Title not available (Why is that?)
- Finite rings with applications.
- On isodual cyclic codes over finite chain rings
- FOUNDATIONS OF LINEAR CODES DEFINED OVER FINITE MODULES: THE EXTENSION THEOREM AND THE MACWILLIAMS IDENTITIES
- Counting codes over rings
- Extension theorems for various weight functions over Frobenius bimodules
- Characteristics of invariant weights related to code equivalence over rings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4470484)
