Change search
ReferencesLink to record
Permanent link

Direct link
Equivocation of Eve using two edge type LDPC codes for the binary erasure wiretap channel
KTH, School of Electrical Engineering (EES), Communication Theory.
KTH, School of Electrical Engineering (EES), Communication Theory.
KTH, School of Electrical Engineering (EES), Communication Theory.ORCID iD: 0000-0001-9307-484X
Klipsch School of Electrical and Computer Engineering New Mexico State University.
Show others and affiliations
2010 (English)In: 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers (ASILOMAR), 2010, 2045-2049 p.Conference paper (Refereed)
Abstract [en]

We consider transmission over a binary erasure wiretap channel using the code construction method introduced by Rathi et al. based on two edge type Low-Density Parity-Check (LDPC) codes and the coset encoding scheme. By generalizing the method of computing conditional entropy for standard LDPC ensembles introduced by MeĢasson, Montanari, and Urbanke to two edge type LDPC ensembles, we show how the equivocation for the wiretapper can be computed. We find that relatively simple constructions give very good secrecy performance and are close to the secrecy capacity.

Place, publisher, year, edition, pages
2010. 2045-2049 p.
, Conference Record of the Asilomar Conference on Signals Systems and Computers, ISSN 1058-6393
Keyword [en]
Decoding, Encoding, Entropy, Equations, Parity check codes, Reliability
National Category
URN: urn:nbn:se:kth:diva-50634DOI: 10.1109/ACSSC.2010.5757907ISI: 000305886000380ScopusID: 2-s2.0-79958014300ISBN: 978-1-4244-9722-5OAI: diva2:462316
44th Asilomar Conference on Signals, Systems and Computers, NOV 07-10, 2010, Pacific Grove, CA

Copyright 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. QC 20120110

Available from: 2012-01-10 Created: 2011-12-06 Last updated: 2013-06-10Bibliographically approved

Open Access in DiVA

fulltext(220 kB)301 downloads
File information
File name FULLTEXT01.pdfFile size 220 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusIEEEXplore

Search in DiVA

By author/editor
Andersson, MattiasRathi, VishwambharThobaben, RagnarSkoglund, Mikael
By organisation
Communication Theory

Search outside of DiVA

GoogleGoogle Scholar
Total: 301 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 490 hits
ReferencesLink to record
Permanent link

Direct link