• Login
    View Item 
    •   Shocker Open Access Repository Home
    • Engineering
    • Electrical Engineering and Computer Science
    • EECS Faculty Scholarship
    • EECS Research Publications
    • View Item
    •   Shocker Open Access Repository Home
    • Engineering
    • Electrical Engineering and Computer Science
    • EECS Faculty Scholarship
    • EECS Research Publications
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Universal covertness for discrete memoryless sources

    Date
    2021-06-21
    Author
    Chou, Rémi
    Bloch, Matthieu R.
    Yener, Aylin
    Metadata
    Show full item record
    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
    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.
    Description
    Click on the DOI link to access the article (may not be free)
    URI
    https://doi.org/10.1109/TIT.2021.3091381
    https://soar.wichita.edu/handle/10057/21673
    Collections
    • EECS Research Publications

    Browse

    All of Shocker Open Access RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsBy TypeThis CollectionBy Issue DateAuthorsTitlesSubjectsBy Type

    My Account

    LoginRegister

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    DSpace software copyright © 2002-2022  DuraSpace
    DSpace Express is a service operated by 
    Atmire NV