Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
126 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Linear codes over Fq which are equivalent to LCD codes (1703.04346v2)

Published 13 Mar 2017 in cs.IT and math.IT

Abstract: 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 injection attacks. Non-binary LCD codes in characteristic 2 can be transformed into binary LCD codes by expansion. In this paper, we introduce a general construction of LCD codes from any linear codes. Further, we show that any linear code over $\mathbb F_{q} (q>3)$ is equivalent to an Euclidean LCD code and any linear code over $\mathbb F_{q2} (q>2)$ is equivalent to a Hermitian LCD code. Consequently an $[n,k,d]$-linear Euclidean LCD code over $\mathbb F_q$ with $q>3$ exists if there is an $[n,k,d]$-linear code over $\mathbb F_q$ and an $[n,k,d]$-linear Hermitian LCD code over $\mathbb F_{q2}$ with $q>2$ exists if there is an $[n,k,d]$-linear code over $\mathbb F_{q2}$. Hence, when $q>3$ (resp.$q>2$) $q$-ary Euclidean (resp. $q2$-ary Hermitian) LCD codes possess the same asymptotical bound as $q$-ary linear codes (resp. $q2$-ary linear codes). Finally, we present an approach of constructing LCD codes by extending linear codes.

Citations (24)

Summary

We haven't generated a summary for this paper yet.