Galois LCD codes over rings
From MaRDI portal
Publication:6067846
DOI10.3934/amc.2022002OpenAlexW4213240612MaRDI QIDQ6067846
Publication date: 14 December 2023
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2022002
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complementary dual codes for counter-measures to side-channel attacks
- Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u}{\langle u^a \rangle}\) and their duals]
- Skew constacyclic codes over finite chain rings
- On \((1 - u)\)-cyclic codes over \(\mathbb F_{p^k}+u\mathbb F_{p^k}\)
- The condition for a cyclic code to have a complementary dual
- On the structure of linear and cyclic codes over a finite chain ring
- Galois LCD codes over finite fields
- Double circulant self-dual and LCD codes over Galois rings
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- \(\sigma\)-LCD codes over finite chain rings
- LCD codes over finite chain rings
- Constacyclic codes over finite commutative semi-simple rings
- Galois self-dual constacyclic codes
- On constacyclic codes over finite chain rings
- THE DETERMINATION OF THE GROUP OF AUTOMORHISMS OF A FINITE CHAIN RING OF CHARACTERSTIC p
- Duality for modules over finite rings and applications to coding theory
- Complementary Dual Algebraic Geometry Codes
- Two Families of LCD BCH Codes
- On the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings
- On $\sigma$ -LCD Codes
- LCD Cyclic Codes Over Finite Fields
- Code equivalence characterizes finite Frobenius rings
This page was built for publication: Galois LCD codes over rings
