Secure multiplex coding with a common message

Please use this identifier to cite or link to this item: https://doi.org/10.1109/ISIT.2011.6033896

DC Field	Value
dc.title	Secure multiplex coding with a common message
dc.contributor.author	Matsumoto, R.
dc.contributor.author	Hayashi, M.
dc.date.accessioned	2016-09-01T07:17:52Z
dc.date.available	2016-09-01T07:17:52Z
dc.date.issued	2011
dc.identifier.isbn	9781457705953
dc.identifier.issn	21578104
dc.identifier.uri	http://scholarbank.nus.edu.sg/handle/10635/126350
dc.description.abstract	We determine the capacity region of the secure multiplex coding with a common message, and evaluate the mutual information and the equivocation rate of a collection of secret messages to the second receiver (eavesdropper), which were not evaluated by Yamamoto et al. © 2011 IEEE.
dc.description.uri	http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ISIT.2011.6033896
dc.source	Scopus
dc.subject	broadcast channel with confidential messages
dc.subject	information theoretic security
dc.subject	multiuser information theory
dc.type	Conference Paper
dc.contributor.department	CENTRE FOR QUANTUM TECHNOLOGIES
dc.description.doi	10.1109/ISIT.2011.6033896
dc.description.sourcetitle	IEEE International Symposium on Information Theory - Proceedings
dc.description.page	1965-1969
dc.description.coden	PISTF
dc.identifier.isiut	NOT_IN_WOS
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check