An Analysis of Slepian-Wolf Coding Problem Based on the Asymptotic Normality

Access this Article

Search this Article

Author(s)

Abstract

Source coding theorem reveals the minimum achievable code length under the condition that the error probability is smaller than or equal to some small constant. In the single user communication system, the source coding theorem was proved for general sources. The class of general source is quite large and it is important result since the result can be applied for a wide class of sources. On the other hand there are several studies to evaluate the achievable code length more precisely for the restricted class of sources by using the restriction. In the multi-user communication system, although the source coding theorem was proved for general correlated sources, there is no study to evaluate the achievable code length more precisely. In this study, we consider the stationary memoryless correlated sources and show the coding theorem for Slepian-Wolf type problem more precisely than the previous result.

Journal

  • IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 94(11), 2220-2225, 2011-11-01

    The Institute of Electronics, Information and Communication Engineers

References:  9

Cited by:  1

Codes

  • NII Article ID (NAID)
    10030191671
  • NII NACSIS-CAT ID (NCID)
    AA10826239
  • Text Lang
    ENG
  • Article Type
    Journal Article
  • ISSN
    09168508
  • Data Source
    CJP  CJPref  J-STAGE 
Page Top