跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2610.16121 · v2

Double circulant LCD codes over $\mathbb{F}_2+u\mathbb{F}_2$ and their related binary LCD codes

首次提交 2026-10-12 11:39
版本更新 2026-11-09 09:04
雷达观测 2026-11-10 13:18
arXiv ↗PDF ↗

摘要

Linear complementary dual (LCD) codes are linear codes that intersect their dual trivially. We study double circulant (Euclidean) LCD codes over the finite chain ring R=F2+uF2R=\mathbb F_2+u\mathbb F_2, where u2=0u^2=0. Using the Chinese Remainder Theorem and the factorization of xn−1x^n-1, we derive an explicit enumeration formula, with a separate treatment of the constituent corresponding to x−1x-1, which is not obtained by a formal specialization of the previously known counting formula over Fq[u]/(uk)\mathbb F_q[u]/(u^k). Assuming Artin's primitive root conjecture for 22, we show that the binary Gray images contain an asymptotically good family of rate 1/21/2 which attains the asymptotic Gilbert--Varshamov bound, i.e., whose relative distance can approach H2−1(1/2)H_2^{-1}(1/2) from below. More importantly from the constructive viewpoint, by combining Gray images with a known extension construction, we obtain a binary LCD code with previously unknown parameters [29,15,7][29,15,7] and construct two explicit permutation-inequivalent binary LCD codes with parameters [45,23,9][45,23,9] and nine binary LCD codes with the best known parameters.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-09 09:04 · 最新观测版本

Double circulant LCD codes over $\mathbb{F}_2+u\mathbb{F}_2$ and their related binary LCD codes

Linear complementary dual (LCD) codes are linear codes that intersect their dual trivially. We study double circulant (Euclidean) LCD codes over the finite chain ring R=F2+uF2R=\mathbb F_2+u\mathbb F_2, where u2=0u^2=0. Using the Chinese Remainder Theorem and the factorization of xn−1x^n-1, we derive an explicit enumeration formula, with a separate treatment of the constituent corresponding to x−1x-1, which is not obtained by a formal specialization of the previously known counting formula over Fq[u]/(uk)\mathbb F_q[u]/(u^k). Assuming Artin's primitive root conjecture for 22, we show that the binary Gray images contain an asymptotically good family of rate 1/21/2 which attains the asymptotic Gilbert--Varshamov bound, i.e., whose relative distance can approach H2−1(1/2)H_2^{-1}(1/2) from below. More importantly from the constructive viewpoint, by combining Gray images with a known extension construction, we obtain a binary LCD code with previously unknown parameters [29,15,7][29,15,7] and construct two explicit permutation-inequivalent binary LCD codes with parameters [45,23,9][45,23,9] and nine binary LCD codes with the best known parameters.

查看此版本解读 →查看此版本原文 ↗