Application of LDGM-LDPC codes to secrecy coding for the type-II binary symmetric wiretap channel

Manik Raina, Ruoheng Liu, Predrag Spasojević, H. Vincent Poor

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

This paper studies the problem of secrecy coding for the type-II binary symmetric memoryless wiretap channel. In this model, the main channel is binary-input and noiseless and the eavesdropper channel is binary-symmetric memoryless. A coding strategy based on secure nested codes is proposed. A capacity achieving length-n code for the eavesdropper channel bins the space {0, 1}n into co-sets which are used for secret messaging. The resulting co-set scheme achieves secrecy capacity of the type-II binary symmetric memoryless channel. As an example, the ensemble of capacity-achieving regular low-density generator-matrix/low-density parity-check (LDGM-LDPC) codes is studied as a basis for binning.

Original languageEnglish (US)
Title of host publicationIEEE Information Theory Workshop 2010, ITW 2010
DOIs
StatePublished - 2010
EventIEEE Information Theory Workshop 2010, ITW 2010 - Cairo, Egypt
Duration: Jan 6 2010Jan 8 2010

Publication series

NameIEEE Information Theory Workshop 2010, ITW 2010

Other

OtherIEEE Information Theory Workshop 2010, ITW 2010
CountryEgypt
CityCairo
Period1/6/101/8/10

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Application of LDGM-LDPC codes to secrecy coding for the type-II binary symmetric wiretap channel'. Together they form a unique fingerprint.

Cite this