Rapprochement between instantly decodable and random linear network coding
-
Altmetric Citations
Yu, Ming; Aboutorab, Neda; Sadeghi, Parastoo
Description
In this paper, a new network coding model is proposed to unify instantly decodable network coding (IDNC) and random linear network coding (RLNC), which have been considered to be incompatible in the literature. This model is based on a novel definition of
| Collections | ANU Research Publications |
|---|---|
| Date published: | 2013 |
| Type: | Conference paper |
| URI: | http://hdl.handle.net/1885/81371 |
| Source: | IEEE International Symposium on Information Theory - Proceedings |
| DOI: | 10.1109/ISIT.2013.6620794 |
Download
| File | Description | Size | Format | Image |
|---|---|---|---|---|
| 01_Yu_Rapprochement_between_2013.pdf | 128.88 kB | Adobe PDF | Request a copy |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 23 August 2018/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator
+61 2 6125 5111
The Australian National University, Canberra
CRICOS Provider : 00120C
ABN : 52 234 063 906
