Relative one-weight linear codes
From MaRDI portal
Publication:2248645
DOI10.1007/s10623-012-9769-0zbMath1333.94062OpenAlexW2129314316MaRDI QIDQ2248645
Publication date: 27 June 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9769-0
Related Items (6)
Two-weight codes, graphs and orthogonal arrays ⋮ The fullrank value function ⋮ The geometric structure of relative one-weight codes ⋮ Unnamed Item ⋮ Value functions and two classes of binary codes ⋮ Extension theorems for various weight functions over Frobenius bimodules
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orthogonality matrices for modules over finite Frobenius rings and MacWilliams' equivalence theorem
- Further results on support weights of certain subcodes
- Notes on the value function
- On admissible rings
- Weighted modules and representations of codes
- Finite-ring combinatorics and MacWilliams' equivalence theorem
- Linear codes over finite chain rings
- On the concept of code-isomorphy
- The structure of linear codes of constant weight
- FOUNDATIONS OF LINEAR CODES DEFINED OVER FINITE MODULES: THE EXTENSION THEOREM AND THE MACWILLIAMS IDENTITIES
- The Geometry of Two-Weight Codes
- An elementary proof of the MacWilliams theorem on equivalence of codes
- Duality for modules over finite rings and applications to coding theory
- The weight hierarchies of q-ary codes of dimension 4
- FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES
- Error-correcting codes: An axiomatic approach
- Characterization of finite Frobenius rings
This page was built for publication: Relative one-weight linear codes
