The DOI matches its Crossref record.
Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applications
Abstract
We present a new algorithm for computing the free distance d/sub free/ of parallel and serially concatenated codes with interleavers, the parameter that dominates the code performance at very high signal-to-noise ratios (SNRs). The knowledge of d/sub free/ allows one to analytically estimate the error floor, which may prevent the use of concatenated codes in applications requiring very low error rates. The algorithm is based on the new notion of constrained subcodes, and permits the computation of large distances for large interleavers without a constraint on the input sequence weight (e.g., up to d/sub free/=40 for a rate-1/3 turbo code with interleaver length N=3568). Applications to practical cases of relevant interest, i.e., (1) the new Consultative Committee for Space Data Systems (CCSDS) standard for deep-space telemetry and (2) the new UMTS/3GPP standard for third-generation personal communications, are presented for the first time. Other related aspects, like a study on the free distance distribution of turbo codes with small/medium interleaver length, and a comparison between parallel and serial concatenation behavior, are also discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
The Art of Error Correcting Coding
Morelos‐Zaragoza, R. H. (2002) · Wiley eBooks · doi:10.1002/0470847824 · Cited by 376
Improved Serially Concatenated Convolution Turbo Code (SCCTC) using chicken swarm optimization
Banerjee, S., & Chattopadhyay, S. (2015) · 2015 IEEE Power, Communication and Information Technology Conference (PCITC) · doi:10.1109/pcitc.2015.7438173 · Cited by 12
Metadata
- Authors
- Garello, R., Pierleoni, P., & Benedetto, S.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2001-05
- Volume
- 19
- Issue
- 5
- Pages
- 800-812
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2110505801
- Cited by
- 189
- References
- 0
- FWCI
- 18.71
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applications. https://app.cochat.ai/papers/10.1109/49.924864
- The paper
- Garello, R., Pierleoni, P., & Benedetto, S. (2001). Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applications. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/49.924864
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.