Please use this identifier to cite or link to this item:
|Title:||Wiretap lattice codes from number fields with no small norm elements||Authors:||Ong, Soon Sheng
|Keywords:||DRNTU::Science::Mathematics::Recreational mathematics||Issue Date:||2014||Source:||Ong, S. S., & Oggier, F. Wiretap lattice codes from number fields with no small norm elements. Designs, Codes and Cryptography, in press.||Series/Report no.:||Designs, codes and cryptography||Abstract:||We consider the problem of designing reliable and con dential lattice codes, known as wiretap lattice codes, for fast fading channels. We identify as code design criterion for nite lattice constellations a nite sum of inverse of algebraic norms, in fact the analogous for nite sums of the known criterion for in nite constellations, which motivates us to study totally real number elds with few elements of small norms, over which ideal lattices can be built to provide wiretap lattice codes. More precisely, we rst narrow down our search to abelian number elds known to provide reliable lattice codes, among which we look for no small inert primes and large regulators.||URI:||https://hdl.handle.net/10356/103869
|ISSN:||0925-1022||DOI:||http://dx.doi.org/10.1007/s10623-014-9935-7||Rights:||© 2014 Springer Science+Business Media New York. This is the author created version of a work that has been peer reviewed and accepted for publication by Designs, Codes and Cryptography, Springer Science+Business Media New York. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1007/s10623-014-9935-7].||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SPMS Journal Articles|
Files in This Item:
|Wiretap Lattice Codes from Number Fields with no.pdf||376.74 kB||Adobe PDF|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.