Low-Weight Canonical Logical Bases from Pair-Partition Codes

@misc{okada2026lowweight,
  title = {{Low-Weight Canonical Logical Bases from Pair-Partition Codes}},
  author = {Koki Okada and Kenta Kasai},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.35601},
  eprint = {2609.35601},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.35601},
}

TY  - UNPB
TI  - Low-Weight Canonical Logical Bases from Pair-Partition Codes
AU  - Koki Okada
AU  - Kenta Kasai
PY  - 2026
DA  - 2026/09/28
PB  - arXiv
DO  - 10.48550/arxiv.2609.35601
UR  - https://arxiv.org/abs/2609.35601
AB  - We construct complete canonical logical bases for qubit CSS codes by assigning quaternary coefficients to binary circulant permutation matrix pair-partition (CPM-PP) checks, constructing and normalizing logical representatives, and expanding the result into binary matrices. When the two check systems have invertible submatrices on disjoint column sets, cofactor representatives are canonically paired by the inverse of a single pairing polynomial. The resulting pairs span the entire logical space. When the pairing polynomial is a cyclic-shift monomial with coefficient one, normalization preserves the binary weights of the representatives. We state the construction for general block dimensions and CPM size, work through a corresponding example, and report the parameters, check ranks, and basis weights of seven binary codes. Representative examples have parameters $[[320,80,14]]$, $[[448,112,18]]$, and $[[2048,512,24]]$. All three have maximum check weight 10 on both the X and Z sides. Their canonical logical representatives have binary weights 25, 27, and 27, respectively, on both the X and Z sides.
ER  -