Title :
Gamma Codes: A low-overhead linear-complexity network coding solution
Author :
Mahdaviani, Kaveh ; Ardakani, Masoud ; Bagheri, Hossein ; Tellambura, Chintha
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, AB, Canada
Abstract :
We introduce a family of sparse random linear network codes with outer-code. Due to the bold role of the incomplete gamma function in their design, we call these codes “Gamma codes”. We show that Gamma codes outperform all the existing linear-complexity network coding solutions in terms of reception overhead, while keeping the encoding and decoding complexity linear in the block length.
Keywords :
computational complexity; linear codes; network coding; random codes; block length; decoding complexity; encoding complexity; gamma codes; gamma function; low-overhead linear-complexity network coding solution; outer-code; sparse random linear network codes; Complexity theory; Decoding; Encoding; Equations; Mathematical model; Network coding; Parity check codes;
Conference_Titel :
Network Coding (NetCod), 2012 International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
978-1-4673-1890-7
DOI :
10.1109/NETCOD.2012.6261896
