Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chang, Li-Jen | en_US |
dc.contributor.author | Wang, Chung-Hsuan | en_US |
dc.contributor.author | Zao, John K. | en_US |
dc.date.accessioned | 2016-03-28T00:05:41Z | - |
dc.date.available | 2016-03-28T00:05:41Z | - |
dc.date.issued | 2014-01-01 | en_US |
dc.identifier.isbn | 978-4-88552-292-5 | en_US |
dc.identifier.issn | en_US | |
dc.identifier.uri | http://hdl.handle.net/11536/129763 | - |
dc.description.abstract | Luby transform (LT) codes are often employed during best-effort packet transfers to offer rateless erasure protection. Efficient as they are, these randomized codes with a small number of input symbols often post an inevitable performance trade-off between the decoding failure rates in their waterfall and error-floor regions. In order to surmount this trade-off, we propose a new encoding strategy that requires a portion of the high-degree output symbols of an LT code to abandon the conventional equally-probable input selection strategy; instead, connect themselves to some specially selected low-degree input symbols. Our simulation results show that shortlength LT codes with merely 10(3) input symbols yield significantly lower symboVhlock failure rates at a small overhead of reception as they employ the proposed strategy. These performanceenhanced rateless codes can have potential applications in realtime multimedia broadcasting. | en_US |
dc.language.iso | en_US | en_US |
dc.title | An Error-Floor Reduction Technique for Short-Length LT Codes | en_US |
dc.type | Proceedings Paper | en_US |
dc.identifier.journal | 2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA) | en_US |
dc.citation.spage | 279 | en_US |
dc.citation.epage | 283 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | 電機資訊學士班 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.contributor.department | Undergraduate Honors Program of Electrical Engineering and Computer Science | en_US |
dc.identifier.wosnumber | WOS:000366046700058 | en_US |
dc.citation.woscount | 0 | en_US |
Appears in Collections: | Conferences Paper |