DocumentCode
3435628
Title
Refined Coding Bounds for Network Error Correction
Author
Yang, Shenghao ; Yeung, Raymond W.
Author_Institution
Chinese Univ. of Hong Kong, Shatin
fYear
2007
fDate
1-6 July 2007
Firstpage
1
Lastpage
5
Abstract
With respect to a given set of local encoding kernels defining a linear network code, refined versions of the Hamming bound, the Singleton bound and the Gilbert-Varshamov bound for network error correction are proved by the weight properties of network codes. This refined Singleton bound is also proved to be tight for linear message sets.
Keywords
error correction codes; Gilbert-Varshamov bound; Hamming bound; Singleton bound; linear network code; local encoding kernels; network error correction coding; refined coding bounds; Block codes; Decoding; Encoding; Error correction; Error correction codes; Hamming distance; Hamming weight; Kernel; Network coding; Pattern matching; Gilbert-Varshamov bound; Network error correction coding; Singleton bound; network Hamming weight;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory for Wireless Networks, 2007 IEEE Information Theory Workshop on
Conference_Location
Solstrand
Print_ISBN
978-1-4244-1200-6
Electronic_ISBN
978-1-4244-1200-6
Type
conf
DOI
10.1109/ITWITWN.2007.4318046
Filename
4318046
Link To Document