Related papers: LCD subspace codes
A subspace code is a nonempty collection of subspaces of the vector space $\mathbb{F}_q^{n}$. A pair of linear codes is called a linear complementary pair (in short LCP) of codes if their intersection is trivial and the sum of their…
Linear complementary dual (LCD) codes are linear codes which intersect their dual codes trivially, which have been of interest and extensively studied due to their practical applications in computational complexity and information…
Recently, the notions of self-orthogonal subspace codes and LCD subspace codes were introduced, and LCD subspace codes obtained from mutually unbiased weighing matrices were studied. In this paper, we provide a method of constructing…
Linear complementary-dual (LCD for short) codes are linear codes that intersect with their duals trivially. LCD codes have been used in certain communication systems. It is recently found that LCD codes can be applied in cryptography. This…
LCD codes are linear codes that intersect with their dual trivially. Quasi cyclic codes that are LCD are characterized and studied by using their concatenated structure. Some asymptotic results are derived. Hermitian LCD codes are…
Linear codes with complementary duals are linear codes whose intersection with their duals are trivial, shortly named LCD codes. In this paper we outline a construction for LCD codes over finite fields of order $q$ using weighing matrices…
Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings $R_k$.…
Linear complementary dual (LCD) codes are linear codes that intersect with their dual trivially. We give a characterization of LCD codes over $\mathbb{F}_q$ having large minimum weights for $q \in \{2,3\}$. Using the characterization, we…
Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivially. Multinegacirculant codes of index $2$ that are LCD are characterized algebraically and some good codes are found in this family. Exact…
We give a complete characterization of simple graphs whose adjacency matrices generate binary linear complementary dual (LCD) codes. In particular, we completely characterize a distance-regular graph which yields an LCD code in terms of the…
Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual are trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault…
Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. These codes were first introduced by Massey in 1964. Nowadays, LCD codes are extensively studied in the…
A construction is presented that allows to produce subspace codes of long length using subspace codes of shorter length in combination with a rank metric code. The subspace distance of the resulting code, called linkage code, is as good as…
In the recent years, there has been active research on self-orthogonal embeddings of linear codes since they yielded some optimal self-orthogonal codes. LCD codes have a trivial hull so they are counterparts of self-orthogonal codes. So it…
Linear complementary dual codes (LCD) are linear codes satisfying $C\cap C^{\perp}=\{0\}$. Under suitable conditions, matrix-product codes that are complementary dual codes are characterized. We construct LCD codes using quasi-orthogonal…
A linear code with a complementary dual (or LCD code) is defined to be a linear code $C$ whose dual code $C^{\perp}$ satisfies $C \cap C^{\perp}$= $\left\{ \mathbf{0}\right\} $. Let $LCD{[}n,k{]}$ denote the maximum of possible values of…
A subspace code is defined as a collection of subspaces of an ambient vector space, where each information-encoding codeword is a subspace. This paper studies a class of spatial sensing problems, notably direction of arrival (DoA)…
Locally recoverable (LRC) codes provide a solution to single node failure in distributed storage systems, where it is a very common problem. On the other hand, linear complementary dual (LCD) codes are useful in fault injections attacks on…
In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and…
LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field with cardinality…