학술
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.
관련 뉴스
'research' 카테고리 뉴스
Correction: Pupillary dynamics during hands-off L2 driving and transitions of control under high cognitive load
PLOS ONE
Correction: Ornamental motifs and visual concerns: Exploring aesthetic pleasure and conservation intention in architectural heritage renovation
PLOS ONE
Correction: Who is disrupting whom? Examining the nighttime activity patterns of humans and their dogs
PLOS ONE