The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Priority encoding transmission
Abstract
We introduce a new method, called priority encoding transmission, for sending messages over lossy packet-based networks. When a message is to be transmitted, the user specifies a priority value for each part of the message. Based on the priorities, the system encodes the message into packets for transmission and sends them to (possibly multiple) receivers. The priority value of each part of the message determines the fraction of encoding packets sufficient to recover that part. Thus even if some of the encoding packets are lost en-route, each receiver is still able to recover the parts of the message for which a sufficient fraction of the encoding packets are received. For any set of priorities for a message, we define a natural quantity called the girth of the priorities. We develop systems for implementing any given set of priorities such that the total length of the encoding packets is equal to the girth. On the other hand, we give an information-theoretic lower bound that shows that for any set of priorities the total length of the encoding packets must be at least the girth. Thus the system we introduce is optimal in terms of the total encoding length. This work has immediate applications to multimedia and high-speed networks applications, especially in those with bursty sources and multiple receivers with heterogeneous capabilities. Implementations of the system show promise of being practical.
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
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
The JPEG still picture compression standard
Wallace, G. K. (1992) · IEEE Transactions on Consumer Electronics · doi:10.1109/30.125072 · Cited by 2,851
MPEG: a video compression standard for multimedia applications
Le Gall, D. (1991) · Communications of the ACM · doi:10.1145/103085.103090 · Cited by 2,013
Efficient dispersal of information for security, load balancing, and fault tolerance
Rabin, M. O. (1989) · Journal of the ACM · doi:10.1145/62044.62050 · Cited by 1,365
Biggs, N. L. (2008) · Springer Undergraduate Mathematics Series · doi:10.1007/978-1-84800-273-9_9 · Cited by 751
van Lint, J. H. (1982) · Graduate Texts in Mathematics · doi:10.1007/978-3-662-07998-0 · Cited by 668
Nonnegative entropy measures of multivariate symmetric correlations
Han, T. S. (1978) · Information and Control · doi:10.1016/s0019-9958(78)90275-9 · Cited by 210
Cited by
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
Streaming video over the Internet: approaches and directions
Wu, D., Hou, Y. T., Zhu, W., Zhang, Y.-Q., & Peha, J. M. (2001) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/76.911156 · Cited by 710
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
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
Multiple description source coding using forward error correction codes
Puri, R., & Ramchandran, K. (2003) · Conference Record of the Thirty-Third Asilomar Conference on Signals, Systems, and Computers (Cat. No.CH37020) · doi:10.1109/acssc.1999.832349 · Cited by 281
Metadata
- Authors
- Albanese, A., Blomer, J., Edmonds, J., Luby, M., & Sudan, M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1996
- Volume
- 42
- Issue
- 6
- Pages
- 1737-1744
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2135144353
- Cited by
- 532
- References
- 7
- FWCI
- 16.05
- 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: Priority encoding transmission. https://app.cochat.ai/papers/10.1109/18.556670
- The paper
- Albanese, A., Blomer, J., Edmonds, J., Luby, M., & Sudan, M. (1996). Priority encoding transmission. IEEE Transactions on Information Theory. https://doi.org/10.1109/18.556670
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.
