Systematic Non-Binary Extension of LDPC-CSS Codes Preserving Orthogonality

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Kasai, Kenta
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866912676421042176
author Kasai, Kenta
author_facet Kasai, Kenta
contents We study finite-field extensions that preserve the same support as the parity-check matrices defining a given binary CSS code. Here, an LDPC-CSS code refers to a CSS code whose parity-check matrices are orthogonal in the sense that each pair of corresponding rows overlaps in an even (possibly zero) number of positions, typically at most twice in sparse constructions. Beyond the low-density setting, we further propose a systematic construction method that extends to arbitrary CSS codes, providing feasible finite-field generalizations that maintain both the binary support and the orthogonality condition.
format Preprint
id arxiv_https___arxiv_org_abs_2510_25583
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Systematic Non-Binary Extension of LDPC-CSS Codes Preserving Orthogonality
Kasai, Kenta
Quantum Physics
Information Theory
We study finite-field extensions that preserve the same support as the parity-check matrices defining a given binary CSS code. Here, an LDPC-CSS code refers to a CSS code whose parity-check matrices are orthogonal in the sense that each pair of corresponding rows overlaps in an even (possibly zero) number of positions, typically at most twice in sparse constructions. Beyond the low-density setting, we further propose a systematic construction method that extends to arbitrary CSS codes, providing feasible finite-field generalizations that maintain both the binary support and the orthogonality condition.
title Systematic Non-Binary Extension of LDPC-CSS Codes Preserving Orthogonality
topic Quantum Physics
Information Theory
url https://arxiv.org/abs/2510.25583