Some new bounds on LCD codes over finite fields

From MaRDI portal
Publication:2202913

DOI10.1007/S12095-019-00417-YzbMATH Open1473.94142arXiv1804.00799OpenAlexW2795594180WikidataQ126385802 ScholiaQ126385802MaRDI QIDQ2202913FDOQ2202913


Authors: Binbin Pang, Shixin Zhu, Xiaoshan Kai Edit this on Wikidata


Publication date: 30 September 2020

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

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 mathbbF3 and mathbbF4. We study the bound of LCD codes over mathbbFq.


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




Recommendations




Cites Work


Cited In (16)





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)