arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2509.03337cs.ITmath.IT
收藏

带应用的线性码新界

New Bounds for Linear Codes with Applications

Liren Lin, Guanghui Zhang, Bocong Chen, Hongwei Liu

AI总结:

本研究在线性码含重量为$w$的非零码字的假设下,结合剩余码技术与经典界推导新显式不等式,强化了码字重量限制,扩大了排除重量范围,可应用于MDS码等场景。

摘要:

线性码的界在编码理论中占据核心地位,因为它们体现了纠错能力(最小距离)与信息率(维数与码长的比值)之间的基本权衡。经典结果仅通过参数$n$、$k$、$d$和$q$来刻画这种权衡关系。在本研究中,我们在码包含一个重量为$w$的非零码字的额外假设下,推导了新的界。通过将剩余码技术与Singleton界、Griesmer界等经典结果相结合,我们得到了关联$n$、$k$、$d$、$q$和$w$的显式不等式。这些界对可容许的码字重量施加了更严格的限制,尤其是对于接近最小距离或接近码长的重量。其应用包括对MDS码(最大距离可分码)重量的精细化约束、对一般线性码的数值限制,以及重量分布中的排除重量范围。对标准参数集的数值比较表明,这些考虑$w$的界严格扩大了已知的排除重量范围,并强化了线性码的结构限制。

英文摘要:

Bounds on linear codes play a central role in coding theory, as they capture the fundamental trade-off between error-correction capability (minimum distance) and information rate (dimension relative to length). Classical results characterize this trade-off solely in terms of the parameters $n$, $k$, $d$ and $q$. In this work we derive new bounds under the additional assumption that the code contains a nonzero codeword of weight $w$.By combining residual-code techniques with classical results such as the Singleton and Griesmer bounds,we obtain explicit inequalities linking $n$, $k$, $d$, $q$ and $w$. These bounds impose sharper restrictions on admissible codeword weights, particularly those close to the minimum distance or to the code length. Applications include refined constraints on the weights of MDS codes, numerical restrictions on general linear codes, and excluded weight ranges in the weight distribution. Numerical comparisons across standard parameter sets demonstrate that these $w$-aware bounds strictly enlarge known excluded weight ranges and sharpen structural limitations on linear codes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑