Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A Classification of Unimodular Lattice Wiretap Codes in Small Dimensions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fuchun Lin ; Div. of Math. Sci., Nanyang Technol. Univ., Singapore, Singapore ; Oggier, F.

Lattice coding over a Gaussian wiretap channel, where an eavesdropper listens to transmissions between a transmitter and a legitimate receiver, is considered. A new lattice invariant called the secrecy gain is used as a code design criterion for wiretap lattice codes since it was shown to characterize the confusion that a chosen lattice can cause at the eavesdropper: the higher the secrecy gain of the lattice, the more confusion. In this paper, secrecy gains of extremal odd unimodular lattices as well as unimodular lattices in dimension n, 16 ≤ n ≤ 23, are computed, covering the four extremal odd unimodular lattices and all the 111 nonextremal unimodular lattices (both odd and even), providing thus a classification of the best wiretap lattice codes coming from unimodular lattices in dimension n, 8 <; n ≤ 23. Finally, to permit lattice encoding via Construction A, the corresponding error correction codes of the best lattices are determined.

Published in:

Information Theory, IEEE Transactions on  (Volume:59 ,  Issue: 6 )