On the coveting radius of extremal self-dual codes
On the coveting radius of extremal self-dual codes
复制标题
论极值自对偶码的贪图半径
DOI：
10.1109/tit.1983.1056681
复制
发表时间：
1983
期刊：
影响因子：
--
通讯作者：
V. Pless
中科院分区：
文献类型：
--
作者：
E. F. Assmus;V. Pless
众所周知，每个不是双重偶数的自对偶二进制码都是双重偶数双亲的“子”。证明了(n，n/2，d)偶双亲的(n-2，(n-2)/2)子代有覆盖半径d-1。每个极值双偶(32，16，8)码的覆盖半径为6，每个极值双偶(48，24，12)码的覆盖半径为8。给出了(32，16，8)二次剩余码的完全陪集重量分布，以及长度小于或等于96的所有极值双偶码的覆盖半径的界或精确值。
It is known that every self-dual binary code which is not doubly even is a "child" of a doubly even parent. It will be shown that an (n-2,(n-2)/2) child of an (n,n/2,d) doubly even parent has covering radius \geq d-1 . Every extremal doubly even (32,16,8) code has covering radius 6 and every extremal doubly even (48,24,12) code has covering radius 8 . The complete coset weight distribution of the (32,16,8) quadratic residue code is given, as well as bounds or exact values for the covering radii of all extremai doubly even codes of length less than or equal to 96 .