The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Design of repeat-accumulate codes for iterative detection and decoding
Abstract
Extrinsic information transfer (EXIT) charts are used to design systematic and nonsystematic repeat-accumulate (RA) codes for iterative detection and decoding. The convergence problems of nonsystematic RA codes are solved by introducing a biregular, or doped, layer of check nodes. As examples, such nonsystematic codes are designed for multi-input/multi-output (MIMO) fading channels and are shown to operate close to capacity.
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
Cites
Capacity of Multi‐antenna Gaussian Channels
Telatar, E. (1999) · European Transactions on Telecommunications · doi:10.1002/ett.4460100604 · Cited by 11,234
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
Berrou, C., Glavieux, A., & Thitimajshima, P. (2002) · Proceedings of ICC '93 - IEEE International Conference on Communications · doi:10.1109/icc.1993.397441 · Cited by 6,738
Foschini, G. J. (2002) · Bell Labs Technical Journal · doi:10.1002/bltj.2015 · Cited by 6,205
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
Bahl, L., Cocke, J., Jelinek, F., & Raviv, J. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055186 · Cited by 5,208
Optimal decoding of linear codes for minimizing symbol error rate
Bahl, L. R. (1974) · IEEE Transactions on Information Theory · Cited by 4,665
Near Shannon limit error-correcting coding and decoding : Turbo-codes
Berrou, C. (1993) · International Conference on Communications · Cited by 4,264
Design of capacity-approaching irregular low-density parity-check codes
Richardson, T. J., Shokrollahi, M. A., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910578 · Cited by 3,335
The capacity of low-density parity-check codes under message-passing decoding
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910577 · Cited by 3,065
Iterative decoding of binary block and convolutional codes
Hagenauer, J., Offer, E., & Papke, L. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485714 · Cited by 2,303
Cited by
Bit-interleaved coded modulation
Caire, G., Taricco, G., & Biglieri, E. (2002) · Proceedings of IEEE International Symposium on Information Theory · doi:10.1109/isit.1997.613011 · Cited by 1,927
Extrinsic information transfer functions: model and erasure channel properties
Ashikhmin, A., Kramer, G., & ten Brink, S. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.836693 · Cited by 756
Self-citationMultiple-antenna techniques for wireless communications - a comprehensive literature survey
Mietzner, J., Schober, R., Lampe, L., Gerstacker, W., & Hoeher, P. (2009) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2009.090207 · Cited by 552
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
A close-to-capacity dirty paper coding scheme
Erez, U., & ten Brink, S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.855586 · Cited by 307
Self-citation
Metadata
- Authors
- ten Brink, S., & Kramer, G.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2003-11
- Volume
- 51
- Issue
- 11
- Pages
- 2764-2772
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2099180514
- Cited by
- 258
- References
- 16
- FWCI
- 22.70
- 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: Design of repeat-accumulate codes for iterative detection and decoding. https://app.cochat.ai/papers/10.1109/tsp.2003.818250
- The paper
- ten Brink, S., & Kramer, G. (2003). Design of repeat-accumulate codes for iterative detection and decoding. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2003.818250
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.