English
Related papers

Related papers: Bounds on Binary Niederreiter-Rosenbloom-Tsfasman …

200 papers

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…

Information Theory · Computer Science 2021-09-15 Stefka Bouyuklieva

In the 2017 paper by Dougherty, Kim, Ozkaya, Sok, and Sol\'e about the linear programming bound for LCD codes the notion $\mathrm{LCD}[n,k]$ was defined for binary LCD $[n,k]$-codes. We find the formula for $\mathrm{LCD}[n,2]$.

Commutative Algebra · Mathematics 2019-09-04 Seth Gannon , Hamid Kulosman

Linear complementary dual (LCD) codes can provide an optimum linear coding solution for the two-user binary adder channel. LCD codes also can be used to against side-channel attacks and fault non-invasive attacks. Let $d_{LCD}(n, k)$ denote…

Information Theory · Computer Science 2024-12-20 Guodong Wang , Shengwei Liu , Hongwei Liu

The main aim of this paper is to study $LCD$ codes. Linear code with complementary dual($LCD$) are those codes which have their intersection with their dual code as $\{0\}$. In this paper we will give rather alternative proof of Massey's…

Information Theory · Computer Science 2018-02-21 Nitin S. Darkunde , Arunkumar R. Patil

Let $t \in \{2,8,10,12,14,16,18\}$ and $n=31s+t\geq 14$, $d_{a}(n,5)$ and $d_{l}(n,5)$ be distances of binary $[n,5]$ optimal linear codes and optimal linear complementary dual (LCD) codes, respectively. We show that an $[n,5,d_{a}(n,5)]$…

Information Theory · Computer Science 2024-09-26 Yang Liu , Ruihu Li , Qiang Fu , Hao Song

Linear complementary dual (LCD) codes introduced by Massey are the codes whose intersections with their dual codes are trivial. It can help to improve the security of the information processed by sensitive devices, especially against…

Information Theory · Computer Science 2020-12-29 Liangdong Lu , Ruihu Li , Qiang Fu , Chen Xuan , Wenping Ma

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…

Information Theory · Computer Science 2023-02-14 Shitao Li , Minjia Shi , Huizhou Liu

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…

Information Theory · Computer Science 2017-03-14 Claude Carlet , Sihem Mesnager , Chunming Tang , Yanfeng Qi

Linear complementary dual (LCD) maximum distance separable (MDS) codes are constructed to given specifications. For given $n$ and $r<n$, with $n$ or $r$ (or both) odd, MDS LCD $(n,r)$ codes are constructed over finite fields whose…

Information Theory · Computer Science 2020-05-19 Ted Hurley

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$.…

Information Theory · Computer Science 2015-06-08 Steven T. Dougherty , Jon-Lark Kim , Buket Ozkaya , Lin Sok , Patrick Solé

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…

Information Theory · Computer Science 2017-01-17 Lucky Galvez , Jon-Lark Kim , Nari Lee , Young Gun Roe , Byung-Sun Won

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…

Information Theory · Computer Science 2017-02-28 Bocong Chen , Hongwei Liu

Linear code with complementary dual($LCD$) are those codes which meet their duals trivially. In this paper we will give rather alternative proof of Massey's theorem\cite{Massey2}, which is one of the most important characterization of $LCD$…

Information Theory · Computer Science 2018-02-09 N. S. Darkunde

Linear complementary dual (LCD) codes can be used to against side-channel attacks and fault noninvasive attacks. Let $d_{a}(n,6)$ and $d_{l}(n,6)$ be the minimum weights of all binary optimal linear codes and LCD codes with length $n$ and…

Information Theory · Computer Science 2024-09-26 Yang Liu , Ruihu Li

We establish a connection between linear complementary dual (LCD) codes and caps in projective space. Using this framework and the structure theory of maximal caps, we derive nonexistence theorems for LCD codes with minimum distance at…

Information Theory · Computer Science 2026-04-07 Keita Ishizuka , Yuhi Kamio

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…

Information Theory · Computer Science 2017-04-13 A. Melakhessou , K. Guenda , T. A. Gulliver , M. Shi , P. Solé

Both linear complementary dual (LCD) codes and maximum distance separable (MDS) codes have good algebraic structures, and they have interesting practical applications such as communication systems, data storage, quantum codes, and so on. So…

Information Theory · Computer Science 2021-05-19 Yansheng Wu , Jong Yoon Hyun , Yoonjin Lee

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…

Information Theory · Computer Science 2017-03-10 Adel Alahmadi , Cem Güneri , Buket Özkaya , Hatoon Shoaib , Patrick Solé

A longstanding open problem in coding theory is to determine the best (asymptotic) rate $R_2(\delta)$ of binary codes with minimum constant (relative) distance $\delta$. An existential lower bound was given by Gilbert and Varshamov in the…

Information Theory · Computer Science 2021-12-20 Leonardo Nagami Coregliano , Fernando Granha Jeronimo , Chris Jones

Linear complementary dual (LCD) codes, which is a class of linear codes introduced by Massey, have been extensively studied in literature recently. It has been shown that LCD codes can help to improve the security of the information…

Information Theory · Computer Science 2020-10-21 Liangdong Lu , Xiuzhen Zhan , Sen Yang , Hao Cao
‹ Prev 1 2 3 10 Next ›