dc.contributor.author Chou, Rémi dc.contributor.author Bloch, Matthieu R. dc.contributor.author Yener, Aylin dc.date.accessioned 2021-08-12T08:42:46Z dc.date.available 2021-08-12T08:42:46Z dc.date.issued 2021-06-21 dc.identifier.citation Chou, 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.3091381 en_US dc.identifier.issn 0018-9448 dc.identifier.issn 1557-9654 dc.identifier.uri https://doi.org/10.1109/TIT.2021.3091381 dc.identifier.uri https://soar.wichita.edu/handle/10057/21673 dc.description Click on the DOI link to access the article (may not be free) en_US dc.description.abstract Consider 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.sponsorship Manuscript 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.iso en_US en_US dc.publisher IEEE en_US dc.relation.ispartofseries IEEE Transactions on Information Theory; dc.subject Source coding en_US dc.subject Channel coding en_US dc.subject Random variables en_US dc.subject Loss measurement en_US dc.subject Entropy en_US dc.subject Decoding en_US dc.subject Standards en_US dc.title Universal covertness for discrete memoryless sources en_US dc.type Conference paper en_US dc.rights.holder © 2021 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission en_US
﻿

Files in this item

FilesSizeFormatView

There are no files associated with this item.