On LCD repeated-root cyclic codes over finite fields
From MaRDI portal
Publication:1743389
DOI10.1007/s12190-017-1118-zzbMath1430.94100OpenAlexW2617413272MaRDI QIDQ1743389
Jin Li, Shixin Zhu, Binbin Pang
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
Related Items
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, A family of cyclic codes with two zeros, New entanglement-assisted quantum MDS codes with maximal entanglement, Hulls of linear codes revisited with applications
Cites Work
- Unnamed Item
- Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
- Quasi-cyclic complementary dual codes
- MDS and self-dual codes over rings
- Linear codes with complementary duals
- The condition for a cyclic code to have a complementary dual
- Euclidean and Hermitian LCD MDS codes
- Linear codes with complementary duals meet the Gilbert-Varshamov bound
- LCD codes over finite chain rings
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- On MDS negacyclic LCD codes
- LCD Cyclic Codes Over Finite Fields
- On repeated-root cyclic codes
- Repeated-root cyclic codes