Notes on linear codes over finite commutative chain rings
From MaRDI portal
Publication:628641
DOI10.1007/S10255-011-0047-0zbMATH Open1207.94077OpenAlexW2163525304MaRDI QIDQ628641FDOQ628641
Publication date: 14 March 2011
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-011-0047-0
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Duality for modules over finite rings and applications to coding theory
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Generalized Hamming weights for linear codes
- On the generalized Hamming weights of product codes
- Ring geometries, two-weight codes, and strongly regular graphs
- A Griesmer bound for linear codes over finite quasi-Frobenius rings
- Code equivalence characterizes finite Frobenius rings
Cited In (6)
- Cyclic codes of length \(2p^n\) over finite chain rings
- Group algebras and coding theory
- Linear Network Coding Over Rings – Part I: Scalar Codes and Commutative Alphabets
- Title not available (Why is that?)
- Codes over affine algebras with a finite commutative chain coefficient ring
- Some remarks on non projective Frobenius algebras and linear codes
This page was built for publication: Notes on linear codes over finite commutative chain rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628641)
