Do non-free LCD codes over finite commutative Frobenius rings exist?
- 20 January 2020
- journal article
- research article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 88 (5) , 825-840
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Spanish State Research Agency (PGC2018-096446-B-C21)
- Ministry of Human Resource Development
This publication has 24 references indexed in Scilit:
- Polycyclic codes over Galois rings with applications to repeated-root constacyclic codesFinite Fields and Their Applications, 2013
- Matrix product codes over finite commutative Frobenius ringsDesigns, Codes and Cryptography, 2012
- Codes over , Gray maps and their binary imagesFinite Fields and Their Applications, 2011
- Independence of vectors in codes over ringsDesigns, Codes and Cryptography, 2008
- Linear codes with complementary duals meet the Gilbert–Varshamov boundDiscrete Mathematics, 2004
- Duality for modules over finite rings and applications to coding theoryAmerican Journal of Mathematics, 1999
- The condition for a cyclic code to have a complementary dualDiscrete Mathematics, 1994
- Linear codes with complementary dualsDiscrete Mathematics, 1992
- Reversible codesInformation and Control, 1964
- Projective ModulesAnnals of Mathematics, 1958