Metraipolis › archive › dc_d63e08301f23

Design of a Family of Rate-Adaptive LDPC Convolutional Codes with Short Constraint Length — arXiv:2610.22231

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.22231
License (as archived)
CC0-1.0
Archived
2026-10-16T10:34:46.161Z
SHA-256 of the archived text
487f234a5cc5773118fb31d58c096d6258a2c07667bfca79b521eb633bb983e8
Stable URL of this page
https://metraipolis.com/documento/dc_d63e08301f23

How to cite

Design of a Family of Rate-Adaptive LDPC Convolutional Codes with Short Constraint Length — arXiv:2610.22231 — arXiv (en), https://arxiv.org/abs/2610.22231 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d63e08301f23 (Metraipolis archive dc_d63e08301f23, sha256 487f234a5cc5773118fb31d58c096d6258a2c07667bfca79b521eb633bb983e8)
BibTeX
@misc{dcd63e08301f23,
  title = {Design of a Family of Rate-Adaptive LDPC Convolutional Codes with Short Constraint Length — arXiv:2610.22231},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.22231},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d63e08301f23; sha256 487f234a5cc5773118fb31d58c096d6258a2c07667bfca79b521eb633bb983e8},
  year = {2026}
}

Archived text

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

This paper studies the design of some high-rate, adaptive, low-density parity-check (LDPC) convolutional codes with short constraint length, based on interleaved parity-check polynomials. Starting from some known results regarding the selection of polynomials that yield codes free of short cycles in the associated Tanner graphs, we propose some new constructions based on Golomb rulers, along with relaxed variants that do not strictly satisfy the Golomb ruler condition, but retain similar structural properties. The result is a family of rate-adaptive code constructions with code rates of the form $R=(n_0-1)/n_0$. Conditions for the absence of length-4 cycles are derived, together with upper bounds on the free distance that are met in all considered examples.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.22231 — 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-16T08:51:02.586Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).