A New Method for the Decoding Delay Distributions of Random Linear Coding Schemes
In this letter, we introduce a new technique for deriving the exact decoding delay distribution expressions of random linear coding schemes over a lossy channel. Our approach is mainly based on two transformations: on the one hand, from an overall perspective, the correspondence between the calculat...
Saved in:
| Published in: | IEEE communications letters Vol. 21; no. 2; pp. 226 - 229 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.02.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 1089-7798, 1558-2558 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this letter, we introduce a new technique for deriving the exact decoding delay distribution expressions of random linear coding schemes over a lossy channel. Our approach is mainly based on two transformations: on the one hand, from an overall perspective, the correspondence between the calculation of the exact decoding delay distribution over a perfect channel and the counting problem for some special matrices can be established. On the other hand, the relationship between some cardinalities of the special matrices and the typical basis of polynomials can be obtained. Last, the decoding delay distribution issues can be solved by employing the polynomial basis representation method. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1089-7798 1558-2558 |
| DOI: | 10.1109/LCOMM.2016.2623299 |