Source coding with side information for error free perfect secrecy systems

dc.contributor.authorHo, S.W.
dc.contributor.authorLai, L.
dc.contributor.authorGrant, A.
dc.contributor.conferenceIEEE International Symposium on Information Theory (ISIT) (7 Jul 2013 - 12 Jul 2013 : Istanbul, Turkey)
dc.date.issued2013
dc.description.abstractThis paper considers source coding problems with the requirements of perfect secrecy and zero error at receivers. In the problems considered in this paper, there is always one transmitter but there can be one or two receivers. Two different scenarios depending on whether the receivers' side information are present at the transmitter or not are considered. By deriving bounds on the probability masses of the cipher-text and the key, the minimum transmission rate and key rate are characterized. Although zero-error capacities are typically difficult to characterize, the perfect secrecy constraint turns out to be the key that simplifies the problems considered in this paper and makes them analytically tractable.
dc.description.statementofresponsibilitySiu-Wai Ho, Lifeng Lai, Alex Grant
dc.identifier.citationIEEE International Symposium on Information Theory - Proceedings, 2013, pp.2214-2218
dc.identifier.doi10.1109/ISIT.2013.6620619
dc.identifier.isbn9781479904464
dc.identifier.issn2157-8095
dc.identifier.orcidHo, S.W. [0000-0002-8630-494X]
dc.identifier.urihttp://hdl.handle.net/2440/123493
dc.language.isoen
dc.publisherIEEE
dc.relation.granthttp://purl.org/au-research/grants/arc/DP1094571
dc.relation.granthttp://purl.org/au-research/grants/arc/DP1094571
dc.relation.ispartofseriesIEEE International Symposium on Information Theory
dc.rights© 2013 IEEE
dc.source.urihttps://doi.org/10.1109/isit.2013.6620619
dc.titleSource coding with side information for error free perfect secrecy systems
dc.typeConference paper
pubs.publication-statusPublished

Files