Second-order achievable rate region of Slepian-Wolf coding problem in terms of smooth max-entropy for general sources

    Research output: Contribution to journalArticlepeer-review

    Abstract

    This letter deals with the Slepian-Wolf coding problem for general sources. The second-order achievable rate region is derived using quantity which is related to the smooth max-entropy and the conditional smooth max-entropy. Moreover, we show the relationship of the functions which characterize the second-order achievable rate region in our study and previous study.

    Original languageEnglish
    Pages (from-to)2275-2280
    Number of pages6
    JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    VolumeE99A
    Issue number12
    DOIs
    Publication statusPublished - 2016 Dec 1

    Keywords

    • General sources
    • Second-order achievable rate region
    • Slepian-Wolf coding problem
    • Smooth max-entropy

    ASJC Scopus subject areas

    • Signal Processing
    • Computer Graphics and Computer-Aided Design
    • Applied Mathematics
    • Electrical and Electronic Engineering

    Fingerprint Dive into the research topics of 'Second-order achievable rate region of Slepian-Wolf coding problem in terms of smooth max-entropy for general sources'. Together they form a unique fingerprint.

    Cite this