Linear codes over finite rings are trace codes
From MaRDI portal
Publication:2185921
DOI10.1016/j.disc.2020.111919zbMath1459.94168OpenAlexW3016354795MaRDI QIDQ2185921
Minjia Shi, Yaqi Lu, Marcus Greferath, Patrick Solé
Publication date: 8 June 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.111919
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal binary codes from trace codes over a non-chain ring
- Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\)
- Few-weight codes from trace codes over a local ring
- Two-weight and three-weight codes from trace codes over \(\mathbb{F}_p + u \mathbb{F}_p + v \mathbb{F}_p + u v \mathbb{F}_p\)
- Some remarks on non projective Frobenius algebras and linear codes
- Trace codes over \(\mathbb {Z}_4,\) and Boolean functions
- A Remark on Frobenius Extensions and Endomorphism Rings
- 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
- Two New Families of Two-Weight Codes
- FEW-WEIGHT CODES FROM TRACE CODES OVER
- Optimal three-weight cubic codes
This page was built for publication: Linear codes over finite rings are trace codes