113 research outputs found
Linear codes with complementary duals meet the Gilbert–Varshamov bound
AbstractUsing the hull dimension spectra of linear codes, we show that linear codes with complementary dual meet the asymptotic Gilbert–Varshamov bound
Linear codes with complementary duals from some strongly regular subgraphs of the McLaughlin graph
We describe a number of properties of some ternary linearcodes defined by the adjacency matrices of some stronglyregular graphs that occur as induced subgraphs of the McLaughlin graph, namely the graphs withparameters and respectively. We show that the codes withparameters ,, , , and obtained from these graphs are linear codes with complementary duals and thus meet the asymptotic Gilbert–Varshamov bound
On MDS Negacyclic LCD Codes
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 elements. We
construct four families of MDS negacyclic LCD codes of length
, and a family of negacyclic LCD codes
of length . Furthermore, we obtain five families of -ary
Hermitian MDS negacyclic LCD codes of length and four
families of Hermitian negacyclic LCD codes of length 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 and -cyclotomic classes we give lower bounds on the minimum
distance
Constructions of optimal LCD codes over large finite fields
In this paper, we prove existence of optimal complementary dual codes (LCD
codes) over large finite fields. We also give methods to generate orthogonal
matrices over finite fields and then apply them to construct LCD codes.
Construction methods include random sampling in the orthogonal group, code
extension, matrix product codes and projection over a self-dual basis.Comment: This paper was presented in part at the International Conference on
Coding, Cryptography and Related Topics April 7-10, 2017, Shandong, Chin
Euclidean and Hermitian LCD MDS codes
Linear codes with complementary duals (abbreviated LCD) are linear codes
whose intersection with their dual is trivial. When they are binary, they play
an important role in armoring implementations against side-channel attacks and
fault injection attacks. Non-binary LCD codes in characteristic 2 can be
transformed into binary LCD codes by expansion. On the other hand, being
optimal codes, maximum distance separable codes (abbreviated MDS) have been of
much interest from many researchers due to their theoretical significant and
practical implications. However, little work has been done on LCD MDS codes. In
particular, determining the existence of -ary LCD MDS codes for
various lengths and dimensions is a basic and interesting problem. In
this paper, we firstly study the problem of the existence of -ary
LCD MDS codes and completely solve it for the Euclidean case. More
specifically, we show that for there exists a -ary Euclidean
LCD MDS code, where , or, , and . Secondly, we investigate several constructions of new Euclidean
and Hermitian LCD MDS codes. Our main techniques in constructing Euclidean and
Hermitian LCD MDS codes use some linear codes with small dimension or
codimension, self-orthogonal codes and generalized Reed-Solomon codes
- …