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

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

2009-03-24

arxiv.org/abs/0903.4014v2

Computer Science

Information Theory

A part of this paper is presented in part at 2009 IEEE Information Theory Workshop (ITW2009), Taormina, Italy, pp.105-109, 200

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Construction of Codes for Wiretap Channel and Secret Key Agreement from Correlated Source Outputs by Using Sparse Matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Construction of Codes for Wiretap Channel and Secret Key Agreement from Correlated Source Outputs by Using Sparse Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction of Codes for Wiretap Channel and Secret Key Agreement from Correlated Source Outputs by Using Sparse Matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-347280