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

Abstract

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.

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 pages

References in corpus (1)

• Hash Property and Coding Theorems for Sparse Matrices and Maximum-Likelihood Coding

Cited by in corpus (2)

• Tight exponential analysis of universally composable privacy amplification and its applications
• Construction of Slepian-Wolf Source Code and Broadcast Channel Code Based on Hash Property