Skip to content
DraconiticResearch
Search Sources API
201,818 studies31 sourcesUpdated 18 min ago
PreprintCC BY 4.0arXiv

Orthogonal SC-LDPC Codes for the IDS Channel

  • Frederik Walter
  • Jessica Bariffi
  • Antonia Wachter-Zeh
Open at sourcePDFDOICite

Abstract

We propose a coding scheme for the insertion, deletion and substitution (IDS) channel tailored to the short strands of DNA-based data storage. Instead of an inner synchronisation code, a spatially coupled LDPC (SC-LDPC) code is placed across the strands, with its coupling axis aligned to the position along the strands. Every decoded position thus becomes an anchor to synchronise the neighbouring strands. The decoding waves of the SC-LDPC code carry these anchors from both ends of the strands towards the middle. We bound the achievable rate from above by the information rate of a single strand and from below by that of a separated receiver. For strands of 100 nucleotides (the relevant regime for DNA-based data storage), our scheme outperforms a rate-matched concatenated construction.

Related

  1. High-Rate Quasi-Dyadic Quantum LDPC Codes
    Alessio Baldelli, Sisi Miao, Laurent Schmalen +2
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  2. Quantum LDPC Codes from Polynomial Minors
    Vahid Nourozi, Roxana Smarandache, David G. M. Mitchell
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryQuantum physics & quantum informationarXiv
  3. Improved Rate-versus-Distance Upper Bounds for LDPC Codes
    Chong Shangguan, Yulin Yang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. LDPC Fractus Codes: Sparse Codes with Recursive Structure
    Jesús Carrillo-Pacheco
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. Design of a Family of Rate-Adaptive LDPC Convolutional Codes with Short Constraint Length
    Massimo Battaglioni, Edoardo Carnevali, Franco Chiaraluce +2
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{walter2026orthogonal,
  title = {{Orthogonal SC-LDPC Codes for the IDS Channel}},
  author = {Frederik Walter and Jessica Bariffi and Antonia Wachter-Zeh},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.14308},
  eprint = {2610.14308},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.14308},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Orthogonal SC-LDPC Codes for the IDS Channel
AU  - Frederik Walter
AU  - Jessica Bariffi
AU  - Antonia Wachter-Zeh
PY  - 2026
DA  - 2026/10/09
PB  - arXiv
DO  - 10.48550/arxiv.2610.14308
UR  - https://arxiv.org/abs/2610.14308
AB  - We propose a coding scheme for the insertion, deletion and substitution (IDS) channel tailored to the short strands of DNA-based data storage. Instead of an inner synchronisation code, a spatially coupled LDPC (SC-LDPC) code is placed across the strands, with its coupling axis aligned to the position along the strands. Every decoded position thus becomes an anchor to synchronise the neighbouring strands. The decoding waves of the SC-LDPC code carry these anchors from both ends of the strands towards the middle. We bound the achievable rate from above by the information rate of a single strand and from below by that of a separated receiver. For strands of 100 nucleotides (the relevant regime for DNA-based data storage), our scheme outperforms a rate-matched concatenated construction.
ER  -