Automated Discovery of Improved Constant Weight Binary Codes

• URL: http://arxiv.org/abs/2603.00174v1
• Date: Thu, 26 Feb 2026 18:06:07 GMT
• Title: Automated Discovery of Improved Constant Weight Binary Codes
• Authors: Christopher D. Rosin,
• Abstract summary: A constant weight binary code consists of $n$-bit binary codewords, each with exactly.<n>w bits equal to 1, such that any two codewords are at least Hamming distance.<n>$A(n,d,w)$ is the maximum size of a constant weight binary code with parameters $n,d,w$.<n>We establish improved lower bounds on $A(n,d,w)$ by constructing new larger codes, for 24 values of $(n,d,w)$ with $6 leq d leq 18$ and $18 le
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A constant weight binary code consists of $n$-bit binary codewords, each with exactly $w$ bits equal to 1, such that any two codewords are at least Hamming distance $d$ apart. $A(n,d,w)$ is the maximum size of a constant weight binary code with parameters $n,d,w$. We establish improved lower bounds on $A(n,d,w)$ by constructing new larger codes, for 24 values of $(n,d,w)$ with $6 \leq d \leq 18$ and $18 \leq n \leq 35$. The improved lower bounds come from two strategies. The first is a tabu search that operates at the level of bit swaps. The second is a novel greedy heuristic that repeatedly chooses the candidate codeword that maximizes a randomly-scored histogram of distances to previously-added codewords. These strategies were proposed by CPro1, an automated protocol that generates, implements, and tests diverse strategies for combinatorial constructions.

Related papers

• Generalized $\mathbb{Z}_p$ toric codes as qudit low-density parity-check codes [5.692499671837265]
  We study two-dimensional translation-invariant CSS stabilizer codes over prime-dimensional qudits on the square lattice under twisted boundary conditions.<n>We find that the best observed $k d2$ at $n$ increases with $p$, with an empirical relation $k d2 = 0.0541, n2ln p + 3.84, n$, compatible with a Bravyi--Poulin--Terhal-type tradeoff when the interaction range grows with system size.
  arXiv  Detail & Related papers  (2026-02-23T18:59:31Z)
• Generalized toric codes on twisted tori for quantum error correction [9.623534315687825]
  Kitaev toric code is widely considered one of the leading candidates for error correction in fault-tolerant quantum computation.<n>Direct methods to increase its logical dimensions, such as lattice surgery or introducing punctures, often incur prohibitive overheads.<n>We introduce a ring-theoretic approach for efficiently analyzing topological CSS codes in two dimensions.
  arXiv  Detail & Related papers  (2025-03-05T19:00:05Z)
• Quantum $(r,δ)$-locally recoverable codes [37.306043163932905]
  We introduce the quantum counterpart of those codes by defining quantum $(r,delta)$-locally recoverable codes.<n>We show that there is an equivalence between the classical and quantum concepts of $(r,delta)$-local recoverability.
  arXiv  Detail & Related papers  (2024-12-21T11:45:32Z)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• Block Circulant Codes with Application to Decentralized Systems [12.014314088945968]
  We develop a family of $[n,k,d]$ block circulant codes that support distributed erasure decoding.<n>The code is ideal for use in protocols that address the data availability problem in blockchain networks.
  arXiv  Detail & Related papers  (2024-06-18T00:22:20Z)
• Superposed Decoding: Multiple Generations from a Single Autoregressive Inference Pass [72.07642648108849]
  Superposed Decoding is a new decoding algorithm that generates $k$ drafts at the cost of one autoregressive inference pass. Superposed Decoding can be combined with other decoding strategies, resulting in universal coverage gains when scaling inference time compute.
  arXiv  Detail & Related papers  (2024-05-28T17:40:48Z)
• A Construction of Evolving $k$-threshold Secret Sharing Scheme over A Polynomial Ring [55.17220687298207]
  The threshold secret sharing scheme allows the dealer to distribute the share to every participant that the secret is correctly recovered from a certain amount of shares. We propose a brand-new construction of evolving $k$-threshold secret sharing scheme for an $ell$-bit secret over a ring, with correctness and perfect security.
  arXiv  Detail & Related papers  (2024-02-02T05:04:01Z)
• A Formal Perspective on Byte-Pair Encoding [100.75374173565548]
  Byte-Pair imation (BPE) is a popular algorithm used for tokenizing data in NLP, despite being devised initially as a compression method. We provide a faster implementation of BPE which improves the runtime complexity from $mathcalOleft(N Mright)$ to $mathcalOleft(N log Mright)$, where $N$ is the sequence length and $M$ is the merge count.
  arXiv  Detail & Related papers  (2023-06-29T10:29:23Z)
• Divisible Codes for Quantum Computation [0.6445605125467572]
  Divisible codes are defined by the property that codeword weights share a common divisor greater than one. This paper explores how they can be used to protect quantum information as it is transformed by logical gates.
  arXiv  Detail & Related papers  (2022-04-27T20:18:51Z)
• Distance bounds for generalized bicycle codes [0.7513100214864644]
  Generalized bicycle (GB) codes is a class of quantum error-correcting codes constructed from a pair of binary circulant matrices. We have done an exhaustive enumeration of GB codes for certain prime circulant sizes in a family of two-qubit encoding codes with row weights 4, 6, and 8. The observed distance scaling is consistent with $A(w)n1/2+B(w)$, where $n$ is the code length and $A(w)$ is increasing with $w$.
  arXiv  Detail & Related papers  (2022-03-31T17:43:34Z)
• TURF: A Two-factor, Universal, Robust, Fast Distribution Learning Algorithm [64.13217062232874]
  One of its most powerful and successful modalities approximates every distribution to an $ell$ distance essentially at most a constant times larger than its closest $t$-piece degree-$d_$. We provide a method that estimates this number near-optimally, hence helps approach the best possible approximation.
  arXiv  Detail & Related papers  (2022-02-15T03:49:28Z)
• Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits [99.86860277006318]
  We consider the problem of combining and learning over a set of adversarial algorithms with the goal of adaptively tracking the best one on the fly. The CORRAL of Agarwal et al. achieves this goal with a regret overhead of order $widetildeO(sqrtd S T)$ where $M$ is the number of base algorithms and $T$ is the time horizon. Motivated by this issue, we propose a new recipe to corral a larger band of bandit algorithms whose regret overhead has only emphlogarithmic dependence on $M$ as long
  arXiv  Detail & Related papers  (2022-02-12T21:55:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.