Lattice code design for the Rayleigh fading wiretap channel

It has been shown recently that coding for the Gaussian Wire tap Channel can be done with nested lattices. A fine lattice intended to the legitimate user must be designed as a usual lattice code for the Gaussian Channel, while a coarse lattice is added to introduce confusion at the eavesdropper, who...

全面介紹

Saved in:
書目詳細資料
Main Authors: Belfiore, Jean-Claude, Oggier, Frederique
其他作者: School of Physical and Mathematical Sciences
格式: Conference or Workshop Item
語言:English
出版: 2011
主題:
在線閱讀:https://hdl.handle.net/10356/93809
http://hdl.handle.net/10220/7083
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
id sg-ntu-dr.10356-93809
record_format dspace
spelling sg-ntu-dr.10356-938092023-02-28T19:18:03Z Lattice code design for the Rayleigh fading wiretap channel Belfiore, Jean-Claude Oggier, Frederique School of Physical and Mathematical Sciences IEEE International Conference on Communications Workshops (2011 : Kyoto, Japan) DRNTU::Science::Mathematics::Discrete mathematics::Cryptography It has been shown recently that coding for the Gaussian Wire tap Channel can be done with nested lattices. A fine lattice intended to the legitimate user must be designed as a usual lattice code for the Gaussian Channel, while a coarse lattice is added to introduce confusion at the eavesdropper, whose theta series must be minimized. We present a design criterion for both the fine and coarse lattice to obtain wire tap lattice codes for the Rayleigh fading Wiretap Channel. Accepted version 2011-09-19T00:41:34Z 2019-12-06T18:45:53Z 2011-09-19T00:41:34Z 2019-12-06T18:45:53Z 2011 2011 Conference Paper Belfiore, J. C., & Oggier, F. (2011). Lattice Code Design for the Rayleigh Fading Wiretap Channel. Proceedings of the 2011 IEEE International Conference on Communications Workshops (ICC) https://hdl.handle.net/10356/93809 http://hdl.handle.net/10220/7083 10.1109/iccw.2011.5963544 156358 en © 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, 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 component of this work in other works. The published version is available at: http://dx.doi.org/10.1109/iccw.2011.5963544. 5 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Science::Mathematics::Discrete mathematics::Cryptography
spellingShingle DRNTU::Science::Mathematics::Discrete mathematics::Cryptography
Belfiore, Jean-Claude
Oggier, Frederique
Lattice code design for the Rayleigh fading wiretap channel
description It has been shown recently that coding for the Gaussian Wire tap Channel can be done with nested lattices. A fine lattice intended to the legitimate user must be designed as a usual lattice code for the Gaussian Channel, while a coarse lattice is added to introduce confusion at the eavesdropper, whose theta series must be minimized. We present a design criterion for both the fine and coarse lattice to obtain wire tap lattice codes for the Rayleigh fading Wiretap Channel.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Belfiore, Jean-Claude
Oggier, Frederique
format Conference or Workshop Item
author Belfiore, Jean-Claude
Oggier, Frederique
author_sort Belfiore, Jean-Claude
title Lattice code design for the Rayleigh fading wiretap channel
title_short Lattice code design for the Rayleigh fading wiretap channel
title_full Lattice code design for the Rayleigh fading wiretap channel
title_fullStr Lattice code design for the Rayleigh fading wiretap channel
title_full_unstemmed Lattice code design for the Rayleigh fading wiretap channel
title_sort lattice code design for the rayleigh fading wiretap channel
publishDate 2011
url https://hdl.handle.net/10356/93809
http://hdl.handle.net/10220/7083
_version_ 1759858221983465472