On LCD repeated-root cyclic codes over finite fields
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 6765484 (Why is no real title available?)
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
- Euclidean and Hermitian LCD MDS codes
- LCD Cyclic Codes Over Finite Fields
- LCD codes over finite chain rings
- Linear codes with complementary duals
- Linear codes with complementary duals meet the Gilbert-Varshamov bound
- MDS and self-dual codes over rings
- On MDS negacyclic LCD codes
- On repeated-root cyclic codes
- Quasi-cyclic complementary dual codes
- Repeated-root cyclic codes
- The condition for a cyclic code to have a complementary dual
Cited in
(9)- Some \(LCD\) cyclic codes of \(2p\) length over finite fields
- Cyclic locally recoverable LCD codes with the help of cyclotomic polynomials
- An overview on skew constacyclic codes and their subclass of LCD codes
- New binary and ternary LCD codes from matrix-product codes
- Some new constructions of isodual and LCD codes over finite fields
- Hulls of linear codes revisited with applications
- New entanglement-assisted quantum MDS codes with maximal entanglement
- Galois LCD codes over finite fields
- A family of cyclic codes with two zeros
This page was built for publication: On LCD repeated-root cyclic codes over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1743389)