Results 11 to 20 of about 168,087 (140)
Characterization and enumeration of complementary dual abelian codes [PDF]
Abelian codes and complementary dual codes form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, a family of abelian codes with complementary dual in a group algebra $\mathbb{F}_{p^ν}[G]$ has been studied under both the Euclidean and Hermitian inner ...
Arunwan Boripan +2 more
exaly +4 more sources
Remark on subcodes of linear complementary dual codes [PDF]
We show that any ternary Euclidean (resp.\ quaternary Hermitian) linear complementary dual $[n,k]$ code contains a Euclidean (resp.\ Hermitian) linear complementary dual $[n,k-1]$ subcode for $2 \le k \le n$. As a consequence, we derive a bound on the largest minimum weights among ternary Euclidean linear complementary dual codes and quaternary ...
Masaaki Harada
exaly +3 more sources
On complementary-dual quasi-cyclic codes
A linear code with a complementary dual (an LCD code) is a linear code \(C\) whose dual \(C^ \perp\) satisfies \(C\cap C^ \perp= \{0\}\). Necessary and sufficient conditions for a cyclic code be an LCD code were given by \textit{X. Yang} and \textit{J. L. Massey} [Discrete Math. 126, No. 1--3, 391--393 (1994; Zbl 0790.94022)].
Morteza Esmaeili, S. Yari
exaly +2 more sources
On the minimum weights of binary linear complementary dual codes [PDF]
Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study the largest minimum weight $d(n,k)$ among all binary linear complementary dual $[n,k]$ codes. We determine $d(n,4)$ for $n \equiv 2,3,4,5,6,9,10,13 \pmod{15}$, and $d(n,5)$ for $n \equiv 3,4,5,7,11,19,20,22,26 ...
Makoto Araya, Masaaki Harada
exaly +5 more sources
On complementary dual additive cyclic codes
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cem Güneri +2 more
exaly +5 more sources
Topological quantum codes from self-complementary self-dual graphs
In this paper we present two new classes of binary quantum codes with minimum distance of at least three, by self-complementary self-dual orientable embeddings of voltage graphs and Paley graphs in the Galois field GF(pr), where p is a prime number and r
Avaz Naghipour, S Shahmorad
exaly +3 more sources
Linear Complementary Dual Codes and Linear Complementary Pairs of AG Codes in Function Fields
In recent years, linear complementary pairs (LCP) of codes and linear complementary dual (LCD) codes have gained significant attention due to their applications in coding theory and cryptography. In this work, we construct explicit LCPs of codes and LCD codes from function fields of genus $g \geq 1$.
Alonso S Castellanos, Luciane Quoos
exaly +4 more sources
On Z₂Z₂[u³]-Additive Cyclic and Complementary Dual Codes
Aydogdu et al. studied the standard forms of generator and parity-check matrices of $\mathbb {Z}_{2}\mathbb {Z}_{2}[u^{3}]$ -additive codes, and presented generators of $\mathbb {Z}_{2}\mathbb {Z}_{2}[u^{3}]$ -additive cyclic codes (Finite Fields Appl.
Xiaotong Hou, Xiangrui Meng, Jian Gao
doaj +1 more source
Connections between Linear Complementary Dual Codes, Permanents and Geometry
Linear codes with complementary duals, or LCD codes, have recently been applied to side-channel and fault injection attack-resistant cryptographic countermeasures.
Adel N. Alahmadi +5 more
doaj +1 more source
Over finite local Frobenius non-chain rings of length 5 and nilpotency index 4 and when the length of the code is relatively prime to the characteristic of the residue field of the ring, the structure of the dual of γ-constacyclic codes is established ...
Castillo-Guillén C. A. +1 more
doaj +1 more source

