Please use this identifier to cite or link to this item:
|Title:||Enabling multiplication in lattice codes via Construction A||Authors:||Oggier, Frederique
|Keywords:||DRNTU::Science::Mathematics||Issue Date:||2013||Source:||Frederique, O., & Jean-Claude, B. (2013). Enabling multiplication in lattice codes via Construction A. 2013 IEEE Information Theory Workshop (ITW), 1-5.||Abstract:||As a first step towards distributed computations in a wireless network, we introduce ideal lattices, that is lattices built over an ideal of a ring of integers in a number field, as a tool for constructing lattice codes at the physical layer. These lattices are not only additive groups as all lattices, but they are also equipped with a multiplication, which enables polynomial operations at each node of the wireless network. In this paper, we show how some of these ideal lattices can be constructed from polynomial codes (generalization of cyclic codes) via Construction A, and illustrate how these lattices enable multiplication.||URI:||https://hdl.handle.net/10356/98610
|DOI:||10.1109/ITW.2013.6691274||Rights:||© Institute of Electrical and Electronics Engineers (IEEE). This is the author created version of a work that has been peer reviewed and accepted for publication by 2013 IEEE Information Theory Workshop (ITW), Institute of Electrical and Electronics Engineers (IEEE). 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: [DOI: http://dx.doi.org/10.1109/ITW.2013.6691274].||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SPMS Conference Papers|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.