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

关于有界重量码

On Bounded Weight Codes

Christine Bachoc, Venkat Chandar, Gerard Cohen, Patrick Sole, Aslan Tchamkerten

摘要:

研究了二进制码的最大长度与其长度N、最小距离D和最小码字重量W的关系。这个函数B(N,D,W)首先用它在极限中的指数增长率来表征,因为对于固定的d=D/N和w=W/N,N趋于无穷大。当w <= 1/2时,B(N,D,W)的指数增长率等于A(N,D)的指数增长率;当1/2< w <= 1时,B(N,D,W)的指数增长率等于A(N,D,W)的指数增长率.其次,利用半定规划(SDP)方法,得到了B(N,D,W)的解析和数值上界。这些边界产生的第二约翰逊界的非渐近改善,并为某些值的参数是紧的。

英文摘要:

The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to infinity for fixed d=D/N and w=W/N. The exponential growth rate of B(N,D,W) is shown to be equal to the exponential growth rate of A(N,D) for w <= 1/2, and equal to the exponential growth rate of A(N,D,W) for 1/2< w <= 1. Second, analytic and numerical upper bounds on B(N,D,W) are derived using the semidefinite programming (SDP) method. These bounds yield a non-asymptotic improvement of the second Johnson bound and are tight for certain values of the parameters.

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

↑