Show simple item record

dc.contributor.authorChou, Rémi
dc.contributor.authorBloch, Matthieu R.
dc.contributor.authorYener, Aylin
dc.date.accessioned2021-08-12T08:42:46Z
dc.date.available2021-08-12T08:42:46Z
dc.date.issued2021-06-21
dc.identifier.citationChou, R. A., Bloch, M. R., & Yener, A. (2021). Universal covertness for discrete memoryless sources. IEEE Transactions on Information Theory, 67(8), 5432-5442. doi:10.1109/TIT.2021.3091381en_US
dc.identifier.issn0018-9448
dc.identifier.issn1557-9654
dc.identifier.urihttps://doi.org/10.1109/TIT.2021.3091381
dc.identifier.urihttps://soar.wichita.edu/handle/10057/21673
dc.descriptionClick on the DOI link to access the article (may not be free)en_US
dc.description.abstractConsider a sequence $X^{n}$ of length n emitted by a Discrete Memoryless Source (DMS) with unknown distribution $p_{X}$. The objective is to construct a lossless source code that maps $X^{n}$ to a sequence \widehat {Y}^{m} of length m that is indistinguishable, in terms of Kullback-Leibler divergence, from a sequence emitted by another DMS with known distribution $p_{Y}$. The main result is the existence of a coding scheme that performs this task with an optimal ratio m/n equal to $H(X)/H(Y)$ , the ratio of the Shannon entropies of the two distributions, as n goes to infinity. The coding scheme overcomes the challenges created by the lack of knowledge about $p_{X}$ by a type-based universal lossless source coding scheme that produces as output an almost uniformly distributed sequence, followed by another type-based coding scheme that jointly performs source resolvability and universal lossless source coding. The result recovers and extends previous results that either assume $p_{X}$ or $p_{Y}$ uniform, or $p_{X}$ known. The price paid for these generalizations is the use of common randomness with vanishing rate, whose length scales as the logarithm of n . By allowing common randomness larger than the logarithm of n but still negligible compared to n , a constructive low-complexity encoding and decoding counterpart to the main result is also provided for binary sources by means of polar codes.en_US
dc.description.sponsorshipManuscript received July 19, 2018; revised October 9, 2020; accepted March 26, 2021. Date of publication June 21, 2021; date of current version July 14, 2021. This work was supported in part by NSF under Grant CIF-1319338, Grant CNS-1314719, and Grant CIF-1527074. This article was presented in part at the 54th Annual Allerton Conference on Communication, Control, and Computing [1]. (Corresponding author: Rémi A. Chou.) Rémi A. Chou is with the Department of Electrical Engineering and Computer Science, Wichita State University, Wichita, KS 67260 USA (e-mail: remi.chou@wichita.edu).en_US
dc.language.isoen_USen_US
dc.publisherIEEEen_US
dc.relation.ispartofseriesIEEE Transactions on Information Theory;
dc.subjectSource codingen_US
dc.subjectChannel codingen_US
dc.subjectRandom variablesen_US
dc.subjectLoss measurementen_US
dc.subjectEntropyen_US
dc.subjectDecodingen_US
dc.subjectStandardsen_US
dc.titleUniversal covertness for discrete memoryless sourcesen_US
dc.typeConference paperen_US
dc.rights.holder© 2021 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permissionen_US


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record