Campus Units
Electrical and Computer Engineering
Document Type
Article
Publication Version
Accepted Manuscript
Publication Date
8-2010
Journal or Book Title
IEEE Communications Letters
Volume
14
Issue
8
First Page
749
Last Page
751
DOI
10.1109/LCOMM.2010.08.092453
Abstract
Practical random network coding based schemes for multicast include a header in each packet that records the transformation between the sources and the terminal. The header introduces an overhead that can be significant in certain scenarios. In previous work, parity check matrices of error control codes along with error decoding were used to reduce this overhead. In this work we propose novel packet formats that allow us to use erasure decoding and list decoding. Both schemes have a smaller overhead compared to the error decoding based scheme, when the number of sources combined in a packet is not too small.
Rights
Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Copyright Owner
IEEE
Copyright Date
2010
Language
en
File Format
application/pdf
Recommended Citation
Li, Shizheng and Ramamoorthy, Aditya, "Improved Compression of Network Coding Vectors Using Erasure Decoding and List Decoding" (2010). Electrical and Computer Engineering Publications. 118.
https://lib.dr.iastate.edu/ece_pubs/118
Comments
This is a manuscript of an article from IEEE Communications Letters 14 (2010): 749, doi: 10.1109/LCOMM.2010.08.092453. Posted with permission.