The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Compression via channel coding - Distributed source coding for sensor networks
Abstract
In recent years, sensor research has been undergoing a quiet revolution, promising to have a significant impact throughout society that could quite possibly dwarf previous milestones in the information revolution. Realizing the great promise of sensor networks requires more than a mere advance in individual technologies. It relies on many components working together in an efficient, unattended, comprehensible, and trustworthy manner. One of the enabling technologies in sensor networks is the distributed source coding (DSC), which refers to the compression of the multiple correlated sensor outputs that does not communicate with each other. DSC allows a many-to-one video coding paradigm that effectively swaps encoder-decoder complexity with respect to conventional video coding, thereby representing a fundamental concept shift in video processing. This article has presented an intensive discussion on two DSC techniques, namely Slepian-Wolf coding and Wyner-Ziv coding. The Slepian and Wolf coding have theoretically shown that separate encoding is as efficient as joint coding for lossless compression in channel 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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002) · IEEE Communications Magazine · doi:10.1109/mcom.2002.1024422 · Cited by 13,644
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,003
A universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
A new, fast, and efficient image codec based on set partitioning in hierarchical trees
Said, A., & Pearlman, W. A. (1996) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/76.499834 · Cited by 5,353
Embedded image coding using zerotrees of wavelet coefficients
Shapiro, J. M. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258085 · Cited by 4,815
Optimal decoding of linear codes for minimizing symbol error rate
Bahl, L. R. (1974) · IEEE Transactions on Information Theory · Cited by 4,665
Error control coding : fundamentals and applications
Lin, S., & Costello, D. J. (1983) · Medical Entomology and Zoology · Cited by 4,296
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
Channel coding with multilevel/phase signals
Ungerboeck, G. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056454 · Cited by 3,751
Writing on dirty paper (Corresp.)
Costa, M. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056659 · Cited by 3,735
Good error-correcting codes based on very sparse matrices
MacKay, D. J. C. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.748992 · Cited by 3,684
Sphere Packings, Lattices and Groups.
Coxeter, H. S. M., Conway, J. H., & Sloane, N. J. A. (1989) · The American Mathematical Monthly · doi:10.2307/2323992 · Cited by 3,377
JPEG2000: Image Compression Fundamentals, Standards and Practice
Taubman, D. S. (2002) · Journal of Electronic Imaging · doi:10.1117/1.1469618 · Cited by 3,159
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
Near optimum error correcting coding and decoding: turbo-codes
Berrou, C., & Glavieux, A. (1996) · IEEE Transactions on Communications · doi:10.1109/26.539767 · Cited by 2,761
On the achievable throughput of a multiantenna Gaussian broadcast channel
Caire, G., & Shamai, S. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.813523 · Cited by 2,527
Sphere Packings, Lattices and Groups
Conway, J. H., & Sloane, N. J. A. (1999) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-6568-7 · Cited by 2,223
On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
Chung, S.-Y., Forney, G. D., Richardson, T. J., & Urbanke, R. (2001) · IEEE Communications Letters · doi:10.1109/4234.905935 · Cited by 1,539
Multiple description coding: compression meets the network
Goyal, V. K. (2001) · IEEE Signal Processing Magazine · doi:10.1109/79.952806 · Cited by 1,344
Girod, B., Aaron, A. M., Rane, S., & Rebollo-Monedero, D. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.839619 · Cited by 1,246
Data Compression Using Adaptive Coding and Partial String Matching
Cleary, J., & Witten, I. (1984) · IEEE Transactions on Communications · doi:10.1109/tcom.1984.1096090 · Cited by 1,241
The context-tree weighting method: basic properties
Willems, F. M. J., Shtarkov, Y. M., & Tjalkens, T. J. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382012 · Cited by 919
CODING FOR CHANNEL WITH RANDOM PARAMETERS
Gel'fand, S. I., & Pinsker, M. S. (1980) · Cited by 890
Nested linear/lattice codes for structured multiterminal binning
Zamir, R., Shamai, S., & Erez, U. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003821 · Cited by 876
Recent results in the Shannon theory
Wyner, A. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055171 · Cited by 633
Trellis coded quantization of memoryless and Gauss-Markov sources
Marcellin, M. W., & Fischer, T. R. (1990) · IEEE Transactions on Communications · doi:10.1109/26.46532 · Cited by 596
Berger, T. (1978) · Medical Entomology and Zoology · Cited by 552
Distributed compression in a dense microsensor network
Pradhan, S. S., Kusuma, J., & Ramchandran, K. (2002) · IEEE Signal Processing Magazine · doi:10.1109/79.985684 · Cited by 537
The CEO problem [multiterminal source coding]
Berger, T., Zhang, Z., & Viswanathan, H. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.490552 · Cited by 489
The Basic Theorems of Information Theory
McMillan, B. (1953) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729028 · Cited by 424
Systematic lossy source/channel coding
Shamai, S., Verdu, S., & Zamir, R. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661505 · Cited by 256
Duality between source coding and channel coding and its extension to the side information case
Pradhan, S. S., Chou, J., & Ramchandran, K. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.810622 · Cited by 237
On Successive Refinement for the Wyner–Ziv Problem
Steinberg, Y., & Merhav, N. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.831781 · Cited by 150
Eyuboglu, M. V., & Forney, G. D. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.179341 · Cited by 121
Wyner–Ziv Coding of Video: An Error-Resilient Compression Framework
Sehgal, A., Jagmohan, A., & Ahuja, N. (2004) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2003.822995 · Cited by 119
Compression of binary memoryless sources using punctured turbo codes
Garcia‐Frias, J., & Zhao, Y. (2002) · IEEE Communications Letters · doi:10.1109/lcomm.2002.803484 · Cited by 104
Capacity of channels with uncoded side information
Shamai, S. S., & Verdú, S. (1995) · European Transactions on Telecommunications · doi:10.1002/ett.4460060514 · Cited by 70
Lattice quantization with side information
Servetto, S. D. (2002) · DCC · doi:10.1109/dcc.2000.838191 · Cited by 66
A review of central issues - Signal processing challenges in active queue management
Bohacek, S. K., Shah, K., Arce, G. R., & Davis, M. (2004) · IEEE Signal Processing Magazine · doi:10.1109/msp.2004.1328090 · Cited by 31
Cited by
Energy conservation in wireless sensor networks: A survey
Anastasi, G., Conti, M., Di Francesco, M., & Passarella, A. (2009) · Ad Hoc Networks · doi:10.1016/j.adhoc.2008.06.003 · Cited by 2,583
A survey on wireless multimedia sensor networks
Akyildiz, I. F., Melodia, T., & Chowdhury, K. R. (2007) · Computer Networks · doi:10.1016/j.comnet.2006.10.002 · Cited by 2,308
Girod, B., Aaron, A. M., Rane, S., & Rebollo-Monedero, D. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.839619 · Cited by 1,246
In-network aggregation techniques for wireless sensor networks: a survey
Fasolo, E., Rossi, M., Widmer, J., & Zorzi, M. (2007) · IEEE Wireless Communications · doi:10.1109/mwc.2007.358967 · Cited by 734
Cellular, Wide-Area, and Non-Terrestrial IoT: A Survey on 5G Advances and the Road Toward 6G
Vaezi, M., Azari, A., Khosravirad, S. R., Shirvanimoghaddam, M., Azari, M. M., Chasaki, D., & Popovski, P. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3151028 · Cited by 631
Metadata
- Authors
- Xiong, Z., Liveris, A. D., & Cheng, S.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2004-09
- Volume
- 21
- Issue
- 5
- Pages
- 80-94
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W2162404506
- Cited by
- 739
- References
- 42
- FWCI
- 49.59
- 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.