On MDS negacyclic LCD codes

DOI10.2298/FIL1901001KMaRDI QIDQ5080276zbMATH OpenWikidataFDO

Authors Mehmet E. Koroglu, Mustafa Sarı

Publication date 31 May 2022

Published in Filomat (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1611.06371

zbMATH Keywords

Euclidean inner productHermitian inner productLCD codeslinear codesnegacyclic codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Abstract: Linear codes with complementary duals (LCD) have a great deal of significance amongst linear codes. Maximum distance separable (MDS) codes are also an important class of linear codes since they achieve the greatest error correcting and detecting capabilities for fixed length and dimension. The construction of linear codes that are both LCD and MDS is a hard task in coding theory. In this paper, we study the constructions of LCD codes that are MDS from negacyclic codes over finite fields of odd prime power $q$ elements. We construct four families of MDS negacyclic LCD codes of length $n|fracq-12$, $n|fracq+12$ and a family of negacyclic LCD codes of length $n=q-1$. Furthermore, we obtain five families of $q^2$-ary Hermitian MDS negacyclic LCD codes of length $n|left(q-1ight)$ and four families of Hermitian negacyclic LCD codes of length $n=q^2+1.$ For both Euclidean and Hermitian cases the dimensions of these codes are determined and for some classes the minimum distances are settled. For the other cases, by studying $q$ and $q^2$-cyclotomic classes we give lower bounds on the minimum distance.

Cites work

• Complementary dual codes for counter-measures to side-channel attacks
• Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
• Constructions of optimal LCD codes over large finite fields
• Explicit MDS Codes With Complementary Duals
• Hermitian LCD codes from cyclic codes
• scientific article; zbMATH DE number 6765484 (Why is no real title available?)
• LCD Cyclic Codes Over Finite Fields
• Linear codes with complementary duals
• Linear codes with complementary duals meet the Gilbert-Varshamov bound
• New Constructions of MDS Codes With Complementary Duals
• New Quantum MDS Codes From Negacyclic Codes
• On complementary-dual quasi-cyclic codes
• On LCD negacyclic codes over finite fields
• On self-dual constacyclic codes over finite fields
• Pseudocyclic maximum-distance-separable codes
• Quasi-cyclic complementary dual codes
• Repeated-root constacyclic codes of length \(2 \ell^m p^n\)
• Reversible codes
• Some bounds on binary LCD codes
• The combinatorics of LCD codes: linear programming bound and orthogonal matrices
• The condition for a cyclic code to have a complementary dual
• The structure of 1-generator quasi-twisted codes and new linear codes
• Two Families of LCD BCH Codes

Cited in

(9)

• Some bounds on binary LCD codes
• On LCD repeated-root cyclic codes over finite fields
• Some new bounds on LCD codes over finite fields
• New entanglement-assisted quantum MDS codes with maximal entanglement
• On projected alternating BB methods for variational inequalities
• scientific article; zbMATH DE number 7113110 (Why is no real title available?)
• MDS constacyclic codes of length \(q+1\) over \(\mathrm{GF}(q)\)
• Several constructions of optimal LCD codes over small finite fields
• On additive conjucyclic codes over fields and rings of order p^2 using Gaussian integers

This page was built for publication: On MDS negacyclic LCD codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080276)