DocumentCode
3208713
Title
UEP network coding for scalable data
Author
Limmanee, Apirath ; Henkel, Werner
Author_Institution
EECS, Jacobs Univ., Bremen
fYear
2008
fDate
1-5 Sept. 2008
Firstpage
333
Lastpage
337
Abstract
We analyze the effect of erasures on the recovery of scalable data when linear network coding is applied. We find that global encoding kernels (GEKs) describing linear network codes have different levels of built-in unequal-erasure-protecting (UEP) capability, allowing us to better protect the high-priority data when GEKs are wisely assigned. A sub-optimal assignment strategy is suggested to achieve fairness and optimality.
Keywords
linear codes; UEP network coding; global encoding kernels; linear network codes; linear network coding; scalable data; sub-optimal assignment strategy; unequal-erasure-protecting coding; Capacity planning; Data communication; Encoding; Error correction codes; Helium; Jacobian matrices; Kernel; Network coding; Turbo codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Turbo Codes and Related Topics, 2008 5th International Symposium on
Conference_Location
Lausanne
Print_ISBN
978-1-4244-2862-5
Electronic_ISBN
978-1-4244-2863-2
Type
conf
DOI
10.1109/TURBOCODING.2008.4658721
Filename
4658721
Link To Document