Title :
Coding for a network coded fountain
Author :
Yang, Shenghao ; Yeung, Raymond W.
Author_Institution :
Inst. of Network Coding, Chinese Univ. of Hong Kong, Hong Kong, China
fDate :
July 31 2011-Aug. 5 2011
Abstract :
Batched sparse (BATS) codes are proposed for transmitting a collection of packets through communication networks employing linear network coding. BATS codes generalize fountain codes and preserve the properties such as ratelessness and low encoding/decoding complexity. Moreover, the buffer size and the computation capability of the intermediate network nodes required to apply BATS codes are independent of the number of packets for transmission. It is verified theoretically for certain cases and demonstrated numerically for the general cases that BATS codes achieve rates very close to the capacity of linear operator channels.
Keywords :
communication complexity; decoding; linear codes; network coding; telecommunication channels; BATS code; batched sparse code; communication networks; computation capability; encoding-decoding complexity; fountain codes; intermediate network nodes; linear network coding; linear operator channel; packet transmission; Complexity theory; Decoding; Encoding; Generators; Network coding; Optimization; Peer to peer computing;
Conference_Titel :
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4577-0596-0
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2011.6034050
