R. Urbanke and A.D. Wyner, \Packetizing for the erasure broadcast channel with an internet application.," in International Conference on Combinatorics, Information Theory and Statistics, 1997, p. 93. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Raw Image Data Transmission over Lossy Packet Networks - Ng, Kovacevic (1997) (3 citations) (Correct)
.... contributed to the reconstructed signal [2] The design of multiple description quantizers is presented by Vaishampayan in [3] while work on using multiple descriptions for image transmission includes [4] and [5] A related problem of packetizing for the erasure broadcast channel is discussed in [6]. Danskin, Davis and Song in [7] propose a fast lossy Internet image transmission scheme for compressed images. The algorithm performs very well. One important difference with regard to our work (besides our working with raw image data) is that in [7] one must wait for all the data to arrive ....
R.L. Urbanke and A.D. Wyner. Packetizing for the erasure broadcast channel with an Internet application. Bell Labs, 1997. Preprint.
Linear-Time Binary Codes Correcting Localized Erasures - Alexander Barg (1997) (Correct)
....the problem of retrieving the lost data at the receiving end at the expense of having a certain data overhead in the transmission. Consequently, coding theory solutions for load balancing and decreasing delays in global networks have been a recurrent topic in the literature [3] 7] 11] 12] [14]. A general idea of these works is the same. Namely, it is suggested to encode the message with MDS codes. If the code has length n and is used to encode k message symbols, then the message can be recovered from any k part of the codeword, and the data overhead is n Gamma k symbols. There are 3 ....
....k symbols. There are 3 general methods of constructing MDS codes known: redundant residue codes, Cauchy matrices, and Reed Solomon codes (see Sect. 10.9, Exercise 11.7, and Ch. 10 of [10] respectively) These methods are utilized in [3] redundant residue codes) 12] Cauchy matrices) and [7] [14] (Reed Solomon codes) The complexity of these constructions is of order n 2 q ary operations (q is the alphabet size) for encoding and decoding. The encoding is performed either by matrix multiplication or by polynomial evaluations; the decoding is basically Lagrange interpolation for RS codes ....
[Article contains additional citation context not shown here]
R. Urbanke and A. Wyner, "Packetizing for the erasure broadcast channel with an Internet application," preprint (1997).
About Priority Encoding Transmission - St Ephane Boucheron (2000) (1 citation) (Correct)
No context found.
R. Urbanke and A.D. Wyner, \Packetizing for the erasure broadcast channel with an internet application.," in International Conference on Combinatorics, Information Theory and Statistics, 1997, p. 93.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC