DocumentCode
2019340
Title
Construction of Linear Network Codes that Achieve a Refined Singleton Bound
Author
Shenghao Yang ; Chi Kin Ngai ; Yeung, R.W.
Author_Institution
Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Shatin
fYear
2007
fDate
24-29 June 2007
Firstpage
1576
Lastpage
1580
Abstract
In this paper, we present a refined version of the Singleton bound for network error correction, and propose an algorithm for constructing network codes that achieve this bound.
Keywords
error correction codes; linear codes; linear network codes; network error correction; refined Singleton bound; Decoding; Error correction; Error correction codes; Greedy algorithms; Hamming distance; Hamming weight; Kernel; Network coding; Parity check codes; Redundancy; Network coding; Singleton bound; error correction;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location
Nice
Print_ISBN
978-1-4244-1397-3
Type
conf
DOI
10.1109/ISIT.2007.4557139
Filename
4557139
Link To Document