On the enumeration and classification of \(\sigma\)-LCD codes over finite commutative chain rings

DOI10.1016/j.disc.2022.112915OpenAlexW4226072575MaRDI QIDQ2142654

Monika Yadav, Anuradha Sharma

Publication date: 27 May 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.112915

zbMATH Keywords

Galois ringsclassification algorithmWitt decomposition

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Finite commutative rings (13M99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complementary dual codes for counter-measures to side-channel attacks
• Curve razionali normali e \(k\)-archi negli spazi finiti
• Linear codes with complementary duals
• On the structure of linear and cyclic codes over a finite chain ring
• On the classification of linear complementary dual codes
• Galois LCD codes over finite fields
• Enumeration formulae for self-dual, self-orthogonal and complementary-dual quasi-cyclic codes over finite fields
• Construction of some codes suitable for both side channel and fault injection attacks
• Euclidean and Hermitian LCD MDS codes
• Linear codes with complementary duals meet the Gilbert-Varshamov bound
• Do non-free LCD codes over finite commutative Frobenius rings exist?
• Mass formulae for Euclidean self-orthogonal and self-dual codes over finite commutative chain rings
• \(\sigma\)-LCD codes over finite chain rings
• Further results on Euclidean and Hermitian linear complementary dual codes
• Linear complementary dual codes over rings
• LCD codes over finite chain rings
• Galois self-dual constacyclic codes
• THE DETERMINATION OF THE GROUP OF AUTOMORHISMS OF A FINITE CHAIN RING OF CHARACTERSTIC p
• A linear construction for certain Kerdock and Preparata codes
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Fundamentals of Error-Correcting Codes
• On the Hamming distance of linear codes over a finite chain ring
• New Characterization and Parametrization of LCD Codes
• The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography

This page was built for publication: On the enumeration and classification of \(\sigma\)-LCD codes over finite commutative chain rings