On LCD repeated-root cyclic codes over finite fields
From MaRDI portal
Publication:1743389
DOI10.1007/S12190-017-1118-ZzbMATH Open1430.94100OpenAlexW2617413272MaRDI QIDQ1743389FDOQ1743389
Authors: Binbin Pang, Shixin Zhu, Jin Li 
Publication date: 13 April 2018
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-017-1118-z
Recommendations
Cites Work
- Linear codes with complementary duals
- The condition for a cyclic code to have a complementary dual
- Linear codes with complementary duals meet the Gilbert-Varshamov bound
- Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- On repeated-root cyclic codes
- Repeated-root cyclic codes
- MDS and self-dual codes over rings
- Quasi-cyclic complementary dual codes
- Title not available (Why is that?)
- Euclidean and Hermitian LCD MDS codes
- LCD Cyclic Codes Over Finite Fields
- LCD codes over finite chain rings
- On MDS negacyclic LCD codes
Cited In (9)
- An overview on skew constacyclic codes and their subclass of LCD codes
- A family of cyclic codes with two zeros
- New binary and ternary LCD codes from matrix-product codes
- Hulls of linear codes revisited with applications
- Some \(LCD\) cyclic codes of \(2p\) length over finite fields
- Cyclic locally recoverable LCD codes with the help of cyclotomic polynomials
- Some new constructions of isodual and LCD codes over finite fields
- Galois LCD codes over finite fields
- New entanglement-assisted quantum MDS codes with maximal entanglement
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)
