Construction of Slepian-Wolf Source Code and Broadcast Channel Code Based on Hash Property

The aim of this paper is to prove theorems for the Slepian-Wolf source coding and the broadcast channel coding (independent messages and no common message) based on the the notion of a stronger version of the hash property for an ensemble of functions. Since an ensemble of sparse matrices has a strong hash property, codes using sparse matrices can realize the achievable rate region. Furthermore, extensions to the multiple source coding and multiple output broadcast channel coding are investigated.Comment: The proofs of Lemmas 4 and 9 are revised. Some proofs are simplified. Some typos are fixed. A part of this paper has been published in Proceedings of 2010 IEEE International Symposium on Information Theory (ISIT2010) and Proceedings of 7th Asia-Europe Workshop "CONCEPTS in INFORMATION THEORY" (AEW7), 2011, 39 page

Construction of Multiple Access Channel Codes Based on Hash Property

The aim of this paper is to introduce the construction of codes for a general discrete stationary memoryless multiple access channel based on the the notion of the hash property. Since an ensemble of sparse matrices has a hash property, we can use sparse matrices for code construction. Our approach has a potential advantage compared to the conventional random coding because it is expected that we can use some approximation algorithms by using the sparse structure of codes.Comment: This paper has been presented in part at Proc. 2011 IEEE Internal Symposium on Information Theory and submitted to IEEE Transactions on Information Theory. 39 page

Construction of Codes for Wiretap Channel and Secret Key Agreement from Correlated Source Outputs by Using Sparse Matrices

The aim of this paper is to prove coding theorems for the wiretap channel coding problem and secret key agreement problem based on the the notion of a hash property for an ensemble of functions. These theorems imply that codes using sparse matrices can achieve the optimal rate. Furthermore, fixed-rate universal coding theorems for a wiretap channel and a secret key agreement are also proved.Comment: A part of this paper is presented in part at 2009 IEEE Information Theory Workshop (ITW2009), Taormina, Italy, pp.105-109, 2009. This paper is submitted to IEEE Transactions on Information Theory. 34 page

Multi-Terminal Codes Using Constrained-Random-Number Generators

A general multi-terminal source code and a general multi-terminal channel code are presented. Constrained-random-number generators with sparse matrices, which are building blocks for the code construction, are used in the construction of both encoders and decoders. Achievable regions for source coding and channel coding are derived in terms of entropy functions, where the capacity region for channel coding provides an alternative to the region of [Somekh-Baruch and Verd\'u, ISIT2006].Comment: 14 pages. This is the extended version of the paper submitted to ISIT2018. (v2) minor chang