Salvato in:
Dettagli Bibliografici
Autori principali: Liu, Yang, Li, Ruihu, Fu, Qiang, Song, Hao
Natura: Preprint
Pubblicazione: 2022
Soggetti:
Accesso online:https://arxiv.org/abs/2210.05238
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866910618785677312
author Liu, Yang
Li, Ruihu
Fu, Qiang
Song, Hao
author_facet Liu, Yang
Li, Ruihu
Fu, Qiang
Song, Hao
contents 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)]$ optimal linear code is not an LCD code, there is an $[n,5,d_{l}(n,5)]=[n,5,d_{a}(n,5)-1]$ optimal LCD code if $t\neq 16$, and an optimal $[n,5,d_{l}(n,5)]$ optimal LCD code has $d_{l}(n,5)=16s+6=d_{a}(n,5)-2$ for $t=16$. Combined with known results on optimal LCD code, $d_{l}(n,5)$ of all $[n,5]$ LCD codes are completely determined.
format Preprint
id arxiv_https___arxiv_org_abs_2210_05238
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Minimum distances of binary optimal LCD codes of dimension five are completely determined
Liu, Yang
Li, Ruihu
Fu, Qiang
Song, Hao
Information Theory
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)]$ optimal linear code is not an LCD code, there is an $[n,5,d_{l}(n,5)]=[n,5,d_{a}(n,5)-1]$ optimal LCD code if $t\neq 16$, and an optimal $[n,5,d_{l}(n,5)]$ optimal LCD code has $d_{l}(n,5)=16s+6=d_{a}(n,5)-2$ for $t=16$. Combined with known results on optimal LCD code, $d_{l}(n,5)$ of all $[n,5]$ LCD codes are completely determined.
title Minimum distances of binary optimal LCD codes of dimension five are completely determined
topic Information Theory
url https://arxiv.org/abs/2210.05238