Optimal binary LCD codes

DOI10.1007/S10623-021-00929-WMaRDI QIDQ2234460zbMATH OpenOpenAlexFDO

Authors Stefka Bouyuklieva

Publication date 19 October 2021

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2010.13399

zbMATH Keywords

LCD codes optimal binary linear codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Abstract: 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 literature and widely applied in data storage, cryptography, etc. In this paper, we prove some properties of binary LCD codes using their shortened and punctured codes. We also present some inequalities for the largest minimum weight

d_{L C D} (n, k)

of binary LCD [n,k] codes for given length n and dimension k. Furthermore, we give two tables with the values of

d_{L C D} (n, k)

for

k l e 32

and

n l e 40

, and two tables with classification results.

Review text

Let \(\mathbb{F}_q\) be the finite field with \(q\) elements, where \(q\) is a prime power. An \([n,k]_q\) code \(C\) over is said to be LCD code if \(C \cap C^{\perp} = \{ 0 \}\), where \(C^\perp\) denotes the dual code of \(C\). An LCD code is said to be optimal if it has the maximum possible minimum distance w.r.t. its length and dimension. In this paper, the author proves some properties of binary LCD codes related to their shortened and punctured codes. Then, some results about the largest minimum weight of a binary LCD code are presented.

Recommendations

Cites work

Cited in

(48)

Describes a project that uses

Uses Software

Code Tables

This page was built for publication: Optimal binary LCD codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2234460)