The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Rate-adaptive codes for distributed source coding
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
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 1×
“However, the performance of the high compression codes so derived is very poor because their graphs contain unconnected or singly-connected source nodes; these structural features impede the transfer of information via the LDPC iterative decoding algorithm [20] [21].”
BackgroundOptimal 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
Low-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
Noiseless coding of correlated information sources
Slepian, D., & Wolf, J. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055037 · Cited by 3,952
The rate-distortion function for source coding with side information at the decoder
Wyner, A., & Ziv, J. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055508 · Cited by 3,023
Proceedings of the IEEE International Conference on Communications
McLaughlin, S., Mulgrew, B., & Cowan, C. F. N. (1989) · Cited by 787
Recent results in the Shannon theory
Wyner, A. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055171 · Cited by 633
Design of Efficiently Encodable Moderate-Length High-Rate Irregular LDPC Codes
Yang, M. H., Ryan, W. E., & Li, Y. (2004) · IEEE Transactions on Communications · doi:10.1109/tcomm.2004.826367 · Cited by 305
Incremental Redundancy Hybrid ARQ Schemes Based on Low-Density Parity-Check Codes
Sesia, S., Caire, G., & Vivier, G. (2004) · IEEE Transactions on Communications · doi:10.1109/tcomm.2004.833022 · Cited by 195
Cited by
Reversible Data Hiding in Encrypted Images With Distributed Source Encoding
Qian, Z., & Zhang, X. (2016) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2015.2418611 · Cited by 313
Metadata
- Authors
- Varodayan, D., Aaron, A., & Girod, B.
- Venue
- Signal Processing
- Publisher
- Elsevier BV
- Published
- 2006-11
- Volume
- 86
- Issue
- 11
- Pages
- 3123-3130
- ISSN
- 0165-1684 (ISSN-L)
- OpenAlex
- W2039182392
- Cited by
- 324
- References
- 12
- FWCI
- 31.19
- 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.