학술

Thirteen Improved Binary Constant-Weight Codes with Explicit Cyclic Orbit Certificates

arXiv Math
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.

Abstract

We exhibit thirteen explicit binary constant-weight codes improving lower bounds recorded in Brouwer's table, including $A(29,6,5)\geq 333$, $A(55,4,5)\geq 66144$, and $A(62,4,5)\geq 107360$.

Their 408,729 codewords are specified by 11,386 orbit representatives under explicitly given cyclic coordinate permutations, together with a standalone reconstruction and distance verifier.

All thirteen orbit expansions were checked to agree exactly with the full codeword lists.

관련 뉴스