Open Source
Thirteen Improved Binary Constant-Weight Codes with Explicit Cyclic Orbit Certificates
arXiv math.IT0 views
arXiv:2611.24958v1 Announce Type: cross 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.
Source:https://arxiv.org/abs/2611.24958PreviousGeneralized Covering radii and Deep Holes of a Family of Antiprimitive Narrow-Sense BCH Codes in Even CharacteristicNextEntanglement Geometry Beyond Polygons: Graph-Theoretic Entanglement Inequalities
Related posts
Omni-modal decomposition autoencoders learn full-stack wearable disentangled representations
0arXiv eess.SP
Spectral Vision Transformer for Efficient Tokenization with Limited Data
0arXiv eess.SP
Gaussian Quasi-Likelihood Estimation for Nonsynchronously Observed L\'evy processes
0arXiv stat.TH
Triple Overlap in Pipelined Krylov Methods on Multi-GPU Systems
0arXiv cs.DC
Rhythm-TTS: High-Fidelity Shortcut Latent Modeling and Probabilistic Rhythm Generation for Zero-Shot Text-to-Speech
0arXiv cs.SD
Learning Integer Winding Evolution Times in Quantum Phase Estimation
0arXiv math.IT