Metraipolis › archive › dc_fb2584f55faa

Convolutional Codes from Cyclic Codes with Guaranteed Free and Local Minimum Distances — arXiv:2609.08296

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.08296
License (as archived)
CC0-1.0
Archived
2026-10-16T15:01:56.845Z
SHA-256 of the archived text
84508cfdd2f727401dbb3049c3461c73121017cca16c893303ca425233d87d9a
Stable URL of this page
https://metraipolis.com/documento/dc_fb2584f55faa

How to cite

Convolutional Codes from Cyclic Codes with Guaranteed Free and Local Minimum Distances — arXiv:2609.08296 — arXiv (en), https://arxiv.org/abs/2609.08296 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fb2584f55faa (Metraipolis archive dc_fb2584f55faa, sha256 84508cfdd2f727401dbb3049c3461c73121017cca16c893303ca425233d87d9a)
BibTeX
@misc{dcfb2584f55faa,
  title = {Convolutional Codes from Cyclic Codes with Guaranteed Free and Local Minimum Distances — arXiv:2609.08296},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.08296},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fb2584f55faa; sha256 84508cfdd2f727401dbb3049c3461c73121017cca16c893303ca425233d87d9a},
  year = {2026}
}

Archived text

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

This paper presents an algebraic method to construct convolutional codes with guaranteed \emph{free and local minimum distances} without limit based on cyclic codes of odd lengths. The constructions are simple but effective, and no computer search is needed. For any two positive integers $r$ and $t$ with $1 \leq r < t$, a rate-$r/t$ convolutional code $\mathcal{C}_{\text{convol}}$ can be constructed by using a chain of $r$ cyclic codes $\mathcal{C}_0, \mathcal{C}_1, \ldots, \mathcal{C}_{r-1}$ of the same length $n$ which satisfy the inclusion condition, $\mathcal{C}_0 \supset \mathcal{C}_1 \supset \ldots \supset \mathcal{C}_{r-1}$. Such a convolutional code $\mathcal{C}_{\text{convol}}$ is composed of a \emph{semi-infinite chain of identical local codes} confined in a diagonal band of width $n$. Each local code $\mathcal{C}_{\text{local}}$ of $\mathcal{C}_{\text{convol}}$ is formed from the $r$ cyclic codes in the code chain and is a specially localized subcode of the \emph{mother code} $\mathcal{C}_0$ in the code chain. The minimum distance $d_{\text{local}}$ of each local code of $\mathcal{C}_{\text{convol}}$ is lower bounded by the minimum distance $d_0$ of the mother code $\mathcal{C}_0$ in the code chain. The local structure of $\mathcal{C}_{\text{convol}}$ allows it to be decoded based on a designed parity-check matrix of the mother code $\mathcal{C}_0$ using a sliding window decoding scheme.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.08296 — 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-16T14:48:50.726Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).