共查询到20条相似文献,搜索用时 31 毫秒
2.
Claude Carlet Sihem Mesnager Chunming Tang Yanfeng Qi 《Designs, Codes and Cryptography》2018,86(11):2605-2618
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) are of much interest from many viewpoints due to their theoretical and practical properties. However, little work has been done on LCD MDS codes. In particular, determining the existence of q-ary [n, k] LCD MDS codes for various lengths n and dimensions k is a basic and interesting problem. In this paper, we firstly study the problem of the existence of q-ary [n, k] LCD MDS codes and solve it for the Euclidean case. More specifically, we show that for \(q>3\) there exists a q-ary [n, k] Euclidean LCD MDS code, where \(0\le k \le n\le q+1\), or, \(q=2^{m}\), \(n=q+2\) and \(k= 3 \text { or } q-1\). 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. 相似文献
3.
In this paper, we generalize the linear complementary dual codes (LCD codes for short) to k-Galois LCD codes, and study them by a uniform method. A necessary and sufficient condition for linear codes to be k-Galois LCD codes is obtained, two classes of k-Galois LCD MDS codes are exhibited. Then, necessary and sufficient conditions for λ-constacyclic codes being k-Galois LCD codes are characterized. Some classes of k-Galois LCD λ-constacyclic MDS codes are constructed. Finally, we study Hermitian LCD λ-constacyclic codes, and present a class of Hermitian LCD λ-constacyclic MDS codes. 相似文献
4.
In this paper1, 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. 相似文献
5.
Chengju Li 《Designs, Codes and Cryptography》2018,86(10):2261-2278
Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. It was proved that asymptotically good Hermitian LCD codes exist. The objective of this paper is to construct some cyclic Hermitian LCD codes over finite fields and analyse their parameters. The dimensions of these codes are settled and the lower bounds on their minimum distances are presented. Most Hermitian LCD codes presented in this paper are not BCH codes. 相似文献
6.
We provide methods and algorithms to construct Hermitian linear complementary dual (LCD) codes over finite fields. We study existence of self-dual basis with respect to Hermitian inner product, and as an application, we construct Euclidean LCD codes by projecting the Hermitian codes over such a basis. Many optimal quaternary Hermitian and ternary Euclidean LCD codes are obtained. Comparisons with classical constructions are made. 相似文献
7.
We give a new concatenated type construction for linear codes with complementary dual (LCD) over small finite fields. In this construction,we need a special class of inner codes that we call isometry codes. Our construction generalizes a recent construction of Carlet et al. (2014–2016) and of Güneri et al. (2016). In particular, it allows us to construct LCD codes with improved parameters directly. 相似文献
9.
Linear complementary dual codes were defined by Massey in 1992, and were used to give an optimum linear coding solution for the two user binary adder channel. In this paper, we define the analog of LCD codes over fields in the ambient space with mixed binary and quaternary alphabets. These codes are additive, in the sense that they are additive subgroups, rather than linear as they are not vector spaces over some finite field. We study the structure of these codes and we use the canonical Gray map from this space to the Hamming space to construct binary LCD codes in certain cases. We give examples of such binary LCD codes which are distance-optimal, i.e., they have the largest minimum distance among all binary LCD codes with the same length and dimension. 相似文献
11.
In this paper, LCD cyclic, self dual and isodual codes over finite chain rings are investigated. It was proven recently that a non-free LCD cyclic code does not exist over finite chain rings. Based on algebraic number theory, we introduce necessary and sufficient conditions for which all free cyclic codes over a finite chain ring are LCD. We have also obtained conditions on the existence of non trivial self dual cyclic codes of any length when the nilpotency index of the maximal ideal of a finite chain ring is even. Further, several constructions of isodual codes are given based on the factorization of the polynomial over a finite chain ring. 相似文献
12.
In this paper, two general methods for constructing self-dual codes are presented. These methods use circulant matrices in circulant or bordered circulant structures to construct the suitable generator matrices. The necessary and sufficient conditions, for the generated codes to be self-dual, are provided. Special cases of the proposed methods include the well known “Pure Double Circulant” construction and the “Bordered Double circulant” construction of self-dual codes. As an example, the methods were applied to search for self-dual codes in GF(5). Many new inequivalent self-dual codes with best known distance are found. 相似文献
13.
In this work we give a characterization of Galois Linear Complementary Dual codes and Galois-invariant codes over mixed alphabets of finite chain rings, which leads to the study of the Gray image of -linear codes, where and that provides LCD codes over . 相似文献
14.
A. M. Romanov 《Journal of Applied and Industrial Mathematics》2008,2(2):252-269
The theory of perfect codes is an area at the juncture of coding theory and design theory which is rather hard to explore. Linear perfect codes were constructed by M. Golay and R. Hamming in the end of the 1940s. Nonlinear perfect codes were discovered by Yu. L. Vasil’ev in 1961. At present, many different methods are known for constructing perfect codes. This article presents a survey of the methods for constructing nonlinear perfect binary codes alongside some open questions of the theory of perfect codes. 相似文献
15.
16.
A linear complementary-dual (LCD) code C is a linear code whose dual code \(C^{\perp }\) satisfies \(C \cap C^{\perp }=\{0\}\). In this work we characterize some classes of LCD q-ary \((\lambda , l)\)-quasi-twisted (QT) codes of length \(n=ml\) with \((m,q)=1\), \(\lambda \in F_{q} \setminus \{0\}\) and \(\lambda \ne \lambda ^{-1}\). We show that every \((\lambda ,l)\)-QT code C of length \(n=ml\) with \(dim(C)<m\) or \(dim(C^{\perp })<m\) is an LCD code. A sufficient condition for r-generator QT codes is provided under which they are LCD. We show that every maximal 1-generator \((\lambda ,l)\)-QT code of length \(n=ml\) with \(l>2\) is either an LCD code or a self-orthogonal code and a sufficient condition for this family of codes is given under which such a code C is LCD. Also it is shown that every maximal 1-generator \((\lambda ,2)\)-QT code is LCD. Several good and optimal LCD QT codes are presented. 相似文献
18.
Most recently, Gao et al. found a nice method to investigate the Euclidean hulls of generalized Reed-Solomon codes in terms of Goppa codes. In this note, we extend the results to general Galois hull. We prove that the Galois hulls of some GRS codes are still GRS codes. We also give some examples on Galois LCD and self-dual MDS codes. Compare with known results, the Galois hulls of GRS codes obtained in this work have flexible parameters. 相似文献
19.
Finite commutative semi-simple rings are direct sum of finite fields. In this study, we investigate the algebraic structure of λ-constacyclic codes over such finite semi-simple rings. Among others, necessary and sufficient conditions for the existence of self-dual, LCD, and Hermitian dual-containing λ-constacyclic codes over finite semi-simple rings are provided. Using the CSS and Hermitian constructions, quantum MDS codes over finite semi-simple rings are constructed. 相似文献
20.
线性互补对偶(LCD)码是一类重要的纠错码,在通信系统、数据存储以及密码等领域都有重要的应用.文章研究了整数模4的剩余类环Z4上偶长度的LCD负循环码,给出了这类码的生成多项式,证明了这类码是自由可逆码;并且利用Z4上偶长度负循环码构造了一类Lee距离至少为6的LCD码. 相似文献