The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Rate-compatible punctured convolutional codes (RCPC codes) and their applications
Abstract
The concept of punctured convolutional codes is extended by punctuating a low-rate 1/N code periodically with period P to obtain a family of codes with rate P/(P+l), where l can be varied between 1 and (N-1)P. A rate-compatibility restriction on the puncturing tables ensures that all code bits of high rate codes are used by the lower-rate codes. This allows transmission of incremental redundancy in ARQ/FEC (automatic repeat request/forward error correction) schemes and continuous rate variation to change from low to high error protection within a data frame. Families of RCPC codes with rates between 8/9 and 1/4 are given for memories M from 3 to 6 (8 to 64 trellis states) together with the relevant distance spectra. These codes are almost as good as the best known general convolutional codes of the respective rates. It is shown that the same Viterbi decoder can be used for all RCPC codes of the same M. the application of RCPC codes to hybrid ARQ/FEC schemes is discussed for Gaussian and Rayleigh fading channels using channel-state information to optimise throughput.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Error control coding : fundamentals and applications
Lin, S., & Costello, D. J. (1983) · Medical Entomology and Zoology · Cited by 4,296
Principles of digital communication and coding
Viterbi, A. J., & Omura, J. K. (1979) · Virtual Defense Library (Ministerio de Defensa) · Cited by 1,427
Error-Correction Coding for Digital Communications
Clark, G. C., & Cain, J. B. (1981) · Springer eBooks · doi:10.1007/978-1-4899-2174-1 · Cited by 1,317
Digital coding of waveforms. Principles and applications to speech and video
Jayant, N. S., & Noll, P. (1985) · Signal Processing · doi:10.1016/0165-1684(85)90053-2 · Cited by 1,111
High-Rate Punctured Convolutional Codes for Soft Decision Viterbi Decoding
Yasuda, Y., Kashiki, K., & Hirata, Y. (1984) · IEEE Transactions on Communications · doi:10.1109/tcom.1984.1096047 · Cited by 344
Punctured convolutional codes of rate(n-1)/nand simplified maximum likelihood decoding (Corresp.)
Cain, J. B., Clark, G., & Geist, J. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1055999 · Cited by 318
Punctured Convolutional Codes of Rate (n - 1)/n and Simplified Maximum Likelihood Decoding
Graupe, D. (1979) · Cited by 175
Cited by
Cooperative communication in wireless networks
Nosratinia, A., Hunter, T. E., & Hedayat, A. (2004) · IEEE Communications Magazine · doi:10.1109/mcom.2004.1341264 · Cited by 2,940
Survey on Free Space Optical Communication: A Communication Theory Perspective
Khalighi, M. A., & Uysal, M. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2329501 · Cited by 2,466
Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation
Bocherer, G., Steiner, F., & Schulte, P. (2015) · IEEE Transactions on Communications · doi:10.1109/tcomm.2015.2494016 · Cited by 828
Rate-distortion methods for image and video compression
Ortego, A., & Ramchandran, K. (1998) · IEEE Signal Processing Magazine · doi:10.1109/79.733495 · Cited by 808
The throughput of hybrid-ARQ protocols for the Gaussian collision channel
Caire, G., & Tuninetti, D. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.930931 · Cited by 685
Cooperative Coding for Wireless Networks
Stefanov, A., & Erkip, E. (2004) · IEEE Transactions on Communications · doi:10.1109/tcomm.2004.833070 · Cited by 497
Mohr, A. E., Riskin, E. A., & Ladner, R. E. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.848236 · Cited by 458
Source-controlled channel decoding
Hagenauer, J. (1995) · IEEE Transactions on Communications · doi:10.1109/26.412719 · Cited by 448
Self-citationThe Art of Error Correcting Coding
Morelos‐Zaragoza, R. H. (2002) · Wiley eBooks · doi:10.1002/0470847824 · Cited by 376
List Viterbi decoding algorithms with applications
Seshadri, N., & Sundberg, C.-E. W. (1994) · IEEE Transactions on Communications · doi:10.1109/tcomm.1994.577040 · Cited by 371
Progressive image coding for noisy channels
Sherwood, P. G., & Zeger, K. (1997) · IEEE Signal Processing Letters · doi:10.1109/97.596882 · Cited by 310
Kramer, G., Marić, I., & Yates, R. D. (2006) · Foundations and Trends® in Networking · doi:10.1561/1300000004 · Cited by 282
Optimized transmission of JPEG2000 streams over wireless channels
Thomos, N., Boulgouris, N. V., & Strintzis, M. G. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.860338 · Cited by 258
Metadata
- Authors
- Hagenauer, J.
- Venue
- IEEE Transactions on Communications
- Published
- 1988-04
- Volume
- 36
- Issue
- 4
- Pages
- 389-400
- ISSN
- 0090-6778 (ISSN-L)
- 1558-0857
- OpenAlex
- W2160647929
- Cited by
- 1,827
- References
- 7
- FWCI
- 10.33
- 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
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.