Please use this identifier to cite or link to this item:
Title: ROME : rateless online MDS code for wireless data broadcasting
Authors: He, N
Xu, Y
Cao, J 
Li, Z
Chen, H
Ren, Y
Issue Date: 2010
Source: GLOBECOM - IEEE Global Telecommunications Conference, 2010, 5683211 How to cite?
Abstract: Packet level coding schemes are used to improve the transmission reliability and efficiency in data broadcasting applications, especially for wireless networks. However, existing coding schemes have large redundancy because packets are coded in random or certain probability distributions. Although the Maximum Distance Separable(MDS) codes are designed without coding redundancy, they are not effective if the packet erasure probability is high. To reduce the coding redundancy, lots of work use the receiver side information to adjust the codes construction on-the-fly, which is more beneficial. However, these work have disadvantages:1) the coding redundancy is also large; 2) the feedback schemes have great affect on code's performance. In this paper, we design a novel "Rateless Online MDS Code"(ROME) with a robust feedback scheme to eliminate the coding redundancy. Our contributions include that our codes are throughput optimal codes without redundancy, and we analyze the theoretical finite field size bound to achieve throughput optimal codes. We also design the finite field construction to speed up the encoding and decoding process. Finally, we compare the performance between ROME and other existing codes, like RLC, LT, RT oblivious and SLT codes, and their performance when feedbacks are erased.
Description: 53rd IEEE Global Communications Conference, GLOBECOM 2010, Miami, FL, 6-10 December 2010
ISBN: 9781424456383
DOI: 10.1109/GLOCOM.2010.5683211
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Aug 14, 2017

Page view(s)

Last Week
Last month
Checked on Aug 13, 2017

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.