Change search
ReferencesLink to record
Permanent link

Direct link
Coding for the Wiretap Channel
KTH, School of Electrical Engineering (EES), Communication Theory.
2011 (English)Licentiate thesis, monograph (Other academic)
Abstract [en]

We consider code design for Wyner’s wiretap channel. Optimal coding schemes for this channel require an overall code that is capacity achieving for the main channel, partitioned into smaller subcodes, all of which are capacity achieving for the wiretapper’s channel. To accomplish this we introduce two edge type low density parity check (LDPC) ensembles for the wiretap channel. For the scenario when the main channel is error free and the wiretapper’s channel is a binary erasure channel (BEC) we find secrecy capacity achieving code sequences based on standard LDPC code sequences for the BEC. However, this construction does not work when there are also erasures on the main channel. For this case we develop a method based on linear programming to optimize two edge type degree distributions. Using this method we find code ensembles that perform close to the secrecy capacity of the binary erasure wiretap channel (BEC- WT). We generalize a method of M ́easson, Montanari, and Urbanke in order to compute the conditional entropy of the message at the wire- tapper. This conditional entropy is a measure of how much information is leaked to the wiretapper. We apply this method to relatively simple ensembles and find that they show very good secrecy performance.

Based on the work of Kudekar, Richardson, and Urbanke, which showed that regular spatially coupled codes are capacity achieving for the BEC, we construct a regular two edge type spatially coupled ensem- ble. We show that this ensemble achieves the whole capacity-equivocation region for the BEC-WT.

We also find a coding scheme using Arıkans polar codes. These codes achieve the whole capacity-equivocation region for any symmetric binary input wiretap channel where the wiretapper’s channel is degraded with respect to the main channel.

 

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology , 2011. , 101 p.
Series
Trita-EE, ISSN 1653-5146 ; 2011:026
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-31579ISBN: 978-91-7415-927-1OAI: oai:DiVA.org:kth-31579DiVA: diva2:404831
Presentation
2011-04-08, Q2, KTH, Osquldas väg 10, Stockholm, 13:15 (English)
Opponent
Supervisors
Funder
ICT - The Next Generation
Note
QC 20110321Available from: 2011-03-21 Created: 2011-03-18 Last updated: 2011-10-30Bibliographically approved

Open Access in DiVA

fulltext(799 kB)1297 downloads
File information
File name FULLTEXT01.pdfFile size 799 kBChecksum SHA-512
6fb6b6bc03527109f423ff362f515b90d3bde5e7d73b25083a412ac0da47a7af4986c0f9d77bec36a9455fc7234d3a66ba38cf9697c34b6ffd0e6390cd8fb22e
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Andersson, Mattias
By organisation
Communication Theory
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar
Total: 1297 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

Total: 389 hits
ReferencesLink to record
Permanent link

Direct link