Please use this identifier to cite or link to this item:
|Title:||Lattice network coding over Euclidean Domains||Authors:||Vázquez-Castro, M. A.
|Keywords:||DRNTU::Science::Mathematics||Issue Date:||2014||Source:||Vazquez-Castro, M.A., & Oggier, F. (2014). Lattice network coding over Euclidean Domains. 2014 Proceedings of the 22nd European Signal Processing Conference (EUSIPCO), 1148-1152.||Series/Report no.:||Abstract:||We propose a novel approach to design and analyse lattice-based network coding. The underlying alphabets are carved from (quadratic imaginary) Euclidean domains with a known Euclidean division algorithm, due to their inherent algorithmical ability to capture analog network coding computations. These alphabets are used to embed linear p-ary codes of length n, p a prime, into n-dimensional Euclidean ambient spaces, via a variation of the so-called Construction A of lattices from linear codes. A study case over one such Euclidean domain is presented and the nominal coding gain of lattices obtained from p-ary Hamming codes is computed for any prime p such that p ≡ 1 (mod 4).||URI:||https://hdl.handle.net/10356/97292
|Rights:||© 2014 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: [Article URL: http://ieeexplore.ieee.org.ezlibproxy1.ntu.edu.sg/xpl/login.jsp?tp=&arnumber=6952389&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6952389].||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.