Current studentsExisting staffContact us
 

Theory of secure network coding

Simple item page
dc.contributor.authorCai, N.
dc.contributor.authorChan, T.
dc.date.issued2011
dc.description.abstractIn this tutorial paper, we focus on the basic theory of linear secure network coding. Our goal is to present fundamental results and provide preliminary knowledge for anyone interested in the area. We first present a model for secure network coding and then a necessary and sufficient condition for a linear network code to be secure. Optimal methods to construct linear secure network codes are also provided. For further investigation of the secure properties of linear network codes, we illuminate different secure criteria and requirements, with a few alternative models.
dc.identifier.citationProceedings of the IEEE, 2011; 99(3):421-437
dc.identifier.doi10.1109/JPROC.2010.2094592
dc.identifier.issn0018-9219
dc.identifier.issn1558-2256
dc.identifier.urihttps://hdl.handle.net/1959.8/118957
dc.language.isoen
dc.publisherIEEE
dc.relation.granthttp://purl.org/au-research/grants/arc/DP1094571
dc.rightsCopyright 2011 IEEE
dc.source.urihttps://doi.org/10.1109/JPROC.2010.2094592
dc.subjectentropy
dc.subjectlinear subspace
dc.subjectlinear transformation
dc.subjectnetwork coding
dc.subjectsecurity
dc.subjectwiretap channels
dc.titleTheory of secure network coding
dc.typeJournal article
pubs.publication-statusPublished
ror.mmsid9915909359301831

Files

Collections