LCP of constacyclic codes over finite chain rings
From MaRDI portal
Publication:6138327
DOI10.1007/s12190-022-01816-wzbMath1522.94117OpenAlexW4309581770MaRDI QIDQ6138327
Ranjeet Sehmi, Ridhima Thakral, Sucheta Dutt
Publication date: 5 September 2023
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-022-01816-w
Cites Work
- Unnamed Item
- Complementary dual codes for counter-measures to side-channel attacks
- Repeated-root constacyclic codes of prime power lengths over finite chain rings
- Linear codes with complementary duals
- The condition for a cyclic code to have a complementary dual
- On the algebraic structure of quasi-cyclic codes. II: Chain rings
- On the structure of linear and cyclic codes over a finite chain ring
- Constructions of optimal LCD codes over large finite fields
- Double circulant self-dual and LCD codes over Galois rings
- LCD codes from tridiagonal Toeplitz matrices
- Construction of MDS twisted Reed-Solomon codes and LCD MDS codes
- Do non-free LCD codes over finite commutative Frobenius rings exist?
- A note on linear complementary pairs of group codes
- Linear complementary pair of group codes over finite chain rings
- Linear complementary pairs of codes over rings
- Linear complementary dual codes over rings
- LCD codes over finite chain rings
- Double circulant LCD codes over \(\mathbb{Z}_4\)
- On the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings
- On Linear Complementary Pairs of Codes
This page was built for publication: LCP of constacyclic codes over finite chain rings
