Priority encoding transmission

We introduce a novel approach for sending messages over lossy packet-based networks. The new method, called Priority Encoding Transmission, allows a user to specify a different priority on each segment of the message. Based on the priorities, the sender uses the system to encode the segments into packets for transmission. The system ensures recovery of the segments in order of their priority. The priority of a segment determines the minimum number of packets sufficient to recover the segment. We define a measure for a set of priorities, called the rate, which dictates how much information about the message must be contained in each bit of the encoding. We develop systems for implementing any set of priorities with rate equal to one. We also give an information-theoretic proof that there is no system that implements a set of priorities with rate greater than one. This work has applications to multi-media and high speed networks applications, especially in those with bursty sources and multiple receivers with heterogeneous capabilities.<<ETX>>

[1]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[2]  Noam Nisan,et al.  Velickovic approximations of general independent distributions , 1992, Symposium on the Theory of Computing.

[3]  H. Whitney,et al.  An inequality related to the isoperimetric inequality , 1949 .

[4]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[5]  Fan Chung Graham,et al.  Some intersection theorems for ordered sets and graphs , 1986, J. Comb. Theory, Ser. A.

[6]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[7]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[8]  Noga Alon,et al.  Linear time erasure codes with nearly optimal recovery , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[9]  Nachum Shacham,et al.  Multicast routing of hierarchical data , 1992, [Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications.

[10]  Te Sun Han Nonnegative Entropy Measures of Multivariate Symmetric Correlations , 1978, Inf. Control..

[11]  Noga Alon,et al.  Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.

[12]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[13]  Didier Le Gall,et al.  MPEG: a video compression standard for multimedia applications , 1991, CACM.

[14]  A. J. McAuley Reliable broadband communication using a burst erasure correcting code , 1990, SIGCOMM 1990.

[15]  Daniel A. Spielman,et al.  Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.

[16]  Anthony J. McAuley,et al.  Reliable broadband communication using a burst erasure correcting code , 1990, SIGCOMM '90.

[17]  Ernst W. Biersack,et al.  Performance Avaluation of Forward Error Correction in an ATM Environment , 1993, IEEE J. Sel. Areas Commun..

[18]  Gregory K. Wallace,et al.  The JPEG still picture compression standard , 1991, CACM.

[19]  Noam Nisan,et al.  Approximations of general independent distributions , 1992, STOC '92.

[20]  Marek Karpinski,et al.  An XOR-based erasure-resilient coding scheme , 1995 .