DocumentCode
2513183
Title
On the optimality of a construction of secure network codes
Author
Yeung, Raymond W. ; Cai, Ning
Author_Institution
Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong
fYear
2008
fDate
6-11 July 2008
Firstpage
166
Lastpage
170
Abstract
In this paper, we prove the optimality of a secure network code we have previously constructed when the wiretapper can choose to access any subset of the channels of a fixed size. Specifically, we prove that the network code we constructed multicasts the maximum possible amount of information to the user nodes securely and uses the minimum amount of randomness to achieve the required security.
Keywords
channel coding; multicast communication; telecommunication security; channel subset; multicast information construction; secure network code; wiretapper; Decoding; Entropy; Indexing; Information security; Law; Legal factors; Linear code; Network coding; Protection; Random variables;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location
Toronto, ON
Print_ISBN
978-1-4244-2256-2
Electronic_ISBN
978-1-4244-2257-9
Type
conf
DOI
10.1109/ISIT.2008.4594969
Filename
4594969
Link To Document