The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Multiple description source coding using forward error correction codes
Abstract
We present an efficient multiple description (MD) source coding scheme to achieve robust communication over unreliable channels. In contrast to the popular signal processing based methods, we propose channel coding principles to correlate the descriptions, and then use this correlation for combating channel impairments. We propose a fast, nearly optimal algorithm that aims to maximize the expected quality at the receiver given the channel state and the side channel rates. Our scheme can be used in conjunction with any source coder that is scalable, and is most easily matched to coders outputting a progressive bitstream. It has applications to the transmission of audio, images, as well as delay-constrained video signals, and can also be used to achieve reliable multicast transmission over the existing Internet with the use of simple protocols. Comparisons of our scheme on standard test images to some of the existing state-of-the-art signal processing based MD methods suggest that our simple scheme outperforms them by significant margins.
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 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
Design of multiple description scalar quantizers
Vaishampayan, V. A. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256491 · Cited by 889
Efficient bit allocation for an arbitrary set of quantizers (speech coding)
Shoham, Y., & Gersho, A. (1988) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.90373 · Cited by 831
Priority encoding transmission
Albanese, A., Blomer, J., Edmonds, J., Luby, M., & Sudan, M. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556670 · Cited by 532
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
An integrated source coding and congestion control framework for video streaming in the Internet
Lee, K., Puri, R., Kim, T.-E., Ramchandran, K., & Bharghavan, V. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2000.832249 · Cited by 47
Self-citation
Cited by
Distributing streaming media content using cooperative networking
Padmanabhan, V. N., Wang, H. J., Chou, P. A., & Sripanidkulchai, K. (2002) · Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video · doi:10.1145/507670.507695 · Cited by 809
Rate-distortion optimized streaming of packetized media
Chou, P. A., & Miao, Z. (2006) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2005.864313 · Cited by 667
Chang, S.-H., Cosman, P. C., & Milstein, L. B. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2081682 · Cited by 480
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
“The problem formulated as above can be solved optimally under a specific target rate constraint by assuming that every product array includes the same number of source+channel bytes, namely . The idea of keeping the size of channel packets constant and varying the amount of protection according to the importance of so…”
Method
Metadata
- Authors
- Puri, R., & Ramchandran, K.
- Venue
- Conference Record of the Thirty-Third Asilomar Conference on Signals, Systems, and Computers (Cat. No.CH37020)
- Publisher
- IEEE
- Published
- 2003-01-22
- Volume
- 1
- Pages
- 342-346
- ISSN
- 1058-6393 (ISSN-L)
- OpenAlex
- W1569287257
- Cited by
- 281
- References
- 6
- FWCI
- 20.97
- Type
- conference paper
- 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.