Metraipolis › archive › dc_699444835f83

Systematic Codes Correcting Two Deletions with Three Redundant Symbols over Large Alphabets — arXiv:2609.38259

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.38259
License (as archived)
CC0-1.0
Archived
2026-10-07T14:40:39.870Z
SHA-256 of the archived text
818263a65427425bd58b177c159d515d887a41b9bbb1cc71ecf10e27ca94b28d
Stable URL of this page
https://metraipolis.com/documento/dc_699444835f83

How to cite

Systematic Codes Correcting Two Deletions with Three Redundant Symbols over Large Alphabets — arXiv:2609.38259 — arXiv (en), https://arxiv.org/abs/2609.38259 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_699444835f83 (Metraipolis archive dc_699444835f83, sha256 818263a65427425bd58b177c159d515d887a41b9bbb1cc71ecf10e27ca94b28d)
BibTeX
@misc{dc699444835f83,
  title = {Systematic Codes Correcting Two Deletions with Three Redundant Symbols over Large Alphabets — arXiv:2609.38259},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.38259},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_699444835f83; sha256 818263a65427425bd58b177c159d515d887a41b9bbb1cc71ecf10e27ca94b28d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38259. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A literal-systematic $q$-ary code leaves its $n$ information symbols unchanged and appends deletion-prone checks. For $n\ge2$, a known lower bound requires three such checks to correct two arbitrary deletions. We give a uniform construction meeting this minimum over a power-of-two alphabet $q<2^{32}n^{10}$, with polynomial-time encoding and decoding. It combines boundary authentication, symmetric field checks, and a pointwise computable coloring of a sparse conflict graph. For one adjacent burst of length at most two, we give a closed-form construction with three check symbols over $q_{\mathrm{adj}}<(n+2)^4$. Alphabet size and fixed-alphabet bit redundancy remain separate objectives.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.38259 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:14:20.774Z dalla pagina https://arxiv.org/catchup/math.IT/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).