Some new bounds on LCD codes over finite fields

DOI10.1007/S12095-019-00417-YMaRDI QIDQ2202913zbMATH OpenOpenAlexWikidataFDO

Authors Binbin Pang, Shixin Zhu, Xiaoshan Kai

Publication date 30 September 2020

Published in Cryptography and Communications (Search for Journal in Brave)

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

zbMATH Keywords

bounds on LCD codes equivalence of LCD codes

Mathematics Subject Classification ID

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

Abstract: In this paper, we show that LCD codes are not equivalent to linear codes over small finite fields. The enumeration of binary optimal LCD codes is obtained. We also get the exact value of LD

(n, 2)

over

m a t h b b F_{3}

and

m a t h b b F_{4}

. We study the bound of LCD codes over

m a t h b b F_{q}

.

Review text

Let \(\mathbb{F}_q\) be a finite field with \(q\) elements. A linear code \(C\) has complementary dual (or LCD) over \(\mathbb{F}_q\) if \(C\bigoplus{C}^{\perp} = F^n_q\). In this paper, the authors show that LCD codes are not equivalent to non-LCD codes over small finite fields. \(\mathrm{LD}(n, k)\) is defined as the maximum of \(d\) such that there exists an \([n, k, d]\) LCD code over \(\mathbb{F}_q.\) The authors have obtained the value for \(\mathrm{LD}(n,2)\) over \(\mathbb{F}_3.\) Further, the authors generalize a conjecture, by \textit{L. Galvez} et al. [Cryptogr. Commun. 10, No. 4, 719--728 (2018; Zbl 1391.94844)], for any finite field \(\mathbb{F}_q\) which states that, let \(n\) and \(k\) be two positive integers, where \(k>0\), then \(\mathrm{LD}(n + 1, k) \ge \mathrm{LD}(n, k)\).

Recommendations

Cites work

Cited in

(21)

This page was built for publication: Some new bounds on LCD codes over finite fields

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