Skip to main content
Erschienen in: Designs, Codes and Cryptography 1/2017

25.10.2016

Lattices from codes over \(\mathbb {Z}_q\): generalization of constructions D, \(D'\) and \(\overline{D}\)

verfasst von: Eleonesio Strey, Sueli I. R. Costa

Erschienen in: Designs, Codes and Cryptography | Ausgabe 1/2017

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, we extend the lattice Constructions D, \(D'\) and \(\overline{D}\) (this latter is also known as Forney’s code formula) from codes over \(\mathbb {F}_p\) to linear codes over \(\mathbb {Z}_q\), where \(q \in \mathbb {N}\). We define an operation in \(\mathbb {Z}_q^n\) called zero-one addition, which coincides with the Schur product when restricted to \(\mathbb {Z}_2^n\) and show that the extended Construction \(\overline{D}\) produces a lattice if and only if the nested codes are closed under this addition. A generalization to the real case of the recently developed Construction \(A'\) is also derived and we show that this construction produces a lattice if and only if the corresponding code over \(\mathbb {Z}_q[X]/X^a\) is closed under a shifted zero-one addition. One of the motivations for this work is the recent use of q-ary lattices in cryptography.
Literatur
2.
3.
Zurück zum Zitat Conway J.H., Sloane N.J.A.: Sphere Packings, Lattices and Groups, 3rd edn. Springer, New York (1998).MATH Conway J.H., Sloane N.J.A.: Sphere Packings, Lattices and Groups, 3rd edn. Springer, New York (1998).MATH
4.
Zurück zum Zitat Dougherty S.T., Gulliver T.A., Wong J.: Self-dual codes over \(\mathbb{Z}_8\) and \(\mathbb{Z}_9\). Des. Codes Cryptogr. 41, 235–249 (2006).MathSciNetCrossRefMATH Dougherty S.T., Gulliver T.A., Wong J.: Self-dual codes over \(\mathbb{Z}_8\) and \(\mathbb{Z}_9\). Des. Codes Cryptogr. 41, 235–249 (2006).MathSciNetCrossRefMATH
5.
Zurück zum Zitat Feng C., Silva D., Kschischang F.R.: Lattice network coding over finite rings. In: Proceedings of 12th Canadian Workshop Information Theory, Kelowna, BC, 17–20 May 2011, pp. 78–81 (2011). Feng C., Silva D., Kschischang F.R.: Lattice network coding over finite rings. In: Proceedings of 12th Canadian Workshop Information Theory, Kelowna, BC, 17–20 May 2011, pp. 78–81 (2011).
6.
Zurück zum Zitat Forney G.D.: Coset codes. Part I: introduction and geometrical classication. IEEE Trans. Inf. Theory 34(5), 1123–1151 (1988).MathSciNetCrossRefMATH Forney G.D.: Coset codes. Part I: introduction and geometrical classication. IEEE Trans. Inf. Theory 34(5), 1123–1151 (1988).MathSciNetCrossRefMATH
7.
8.
Zurück zum Zitat Harshan J., Viterbo E., Belfiore J.-C.: Construction of Barnes–Wall Lattices from Linear Codes over Rings. In: Proceedings of the IEEE International Symposium on Information Theory, Cambridge, MA, 1–6 July 2012, pp. 3110–3114 (2012). Harshan J., Viterbo E., Belfiore J.-C.: Construction of Barnes–Wall Lattices from Linear Codes over Rings. In: Proceedings of the IEEE International Symposium on Information Theory, Cambridge, MA, 1–6 July 2012, pp. 3110–3114 (2012).
9.
Zurück zum Zitat Harshan J., Viterbo E., Belfiore J.-C.: Practical encoders and decoders for Euclidean codes from Barnes–Wall lattices. IEEE Trans. Commun. 61(11), 4417–4427 (2013).CrossRef Harshan J., Viterbo E., Belfiore J.-C.: Practical encoders and decoders for Euclidean codes from Barnes–Wall lattices. IEEE Trans. Commun. 61(11), 4417–4427 (2013).CrossRef
10.
Zurück zum Zitat Jorge G.C.: \(q\)-ary and Algebraic Lattices \((\)in Portuguese\()\). PhD Thesis, Institute of Mathematics, University of Campinas, Brazil (2012). Jorge G.C.: \(q\)-ary and Algebraic Lattices \((\)in Portuguese\()\). PhD Thesis, Institute of Mathematics, University of Campinas, Brazil (2012).
11.
Zurück zum Zitat Jorge, G.C., Campello A.C., Costa S.I.R.: q-ary lattices in the \(l_p\) norm and a generalization of the Lee metric. In: Proceedings of the International Workshop on Coding and Crytography, Bergen (2013). Jorge, G.C., Campello A.C., Costa S.I.R.: q-ary lattices in the \(l_p\) norm and a generalization of the Lee metric. In: Proceedings of the International Workshop on Coding and Crytography, Bergen (2013).
12.
13.
Zurück zum Zitat Kositwattanarerk W., Oggier F.: On construction D and related constructions of lattices from linear codes. In: Proceedings of the International Workshop on Coding and Cryptography, Bergen, 15–19 April 2013, pp. 428–437 (2013). Kositwattanarerk W., Oggier F.: On construction D and related constructions of lattices from linear codes. In: Proceedings of the International Workshop on Coding and Cryptography, Bergen, 15–19 April 2013, pp. 428–437 (2013).
14.
Zurück zum Zitat Kositwattanarerk W., Oggier F.: Connections between construction \(D\) and related constructions of lattices. Des. Codes Cryptogr. 73, 441–455 (2014).MathSciNetCrossRefMATH Kositwattanarerk W., Oggier F.: Connections between construction \(D\) and related constructions of lattices. Des. Codes Cryptogr. 73, 441–455 (2014).MathSciNetCrossRefMATH
16.
Zurück zum Zitat Micciancio D., Regev O.: Lattice-based cryptography. In: Bernstein D.J., Buchmann J., Dahmen E. (eds.) Post Quantum Cryptography, pp. 147–191. Springer, Berlin (2009).CrossRef Micciancio D., Regev O.: Lattice-based cryptography. In: Bernstein D.J., Buchmann J., Dahmen E. (eds.) Post Quantum Cryptography, pp. 147–191. Springer, Berlin (2009).CrossRef
18.
Zurück zum Zitat Sadeghi M.-R., Banihashemi A.H., Panario D.: Low-density parity-check lattices: construction and decoding analysis. IEEE Trans. Inf. Theory 52(10), 4481–4495 (2006).MathSciNetCrossRefMATH Sadeghi M.-R., Banihashemi A.H., Panario D.: Low-density parity-check lattices: construction and decoding analysis. IEEE Trans. Inf. Theory 52(10), 4481–4495 (2006).MathSciNetCrossRefMATH
19.
20.
Zurück zum Zitat Yan Y., Ling C., Wu X.: Polar lattices: where Arikan meets Forney. In: IEEE International Symposium on Information Theory, Istanbul, 7–12 July 2013, pp. 1292–1296 (2013). Yan Y., Ling C., Wu X.: Polar lattices: where Arikan meets Forney. In: IEEE International Symposium on Information Theory, Istanbul, 7–12 July 2013, pp. 1292–1296 (2013).
21.
Zurück zum Zitat Yu-Chih, H., Narayanan, K.R.: Construction \(\pi _A\) and \(\pi _D\) Lattices: Construction, Goodness, and Decoding Algorithms. arXiv:1506.08269 (2015). Yu-Chih, H., Narayanan, K.R.: Construction \(\pi _A\) and \(\pi _D\) Lattices: Construction, Goodness, and Decoding Algorithms. arXiv:​1506.​08269 (2015).
22.
Zurück zum Zitat Zamir R.: Lattices are everywhere. In: Proceedings of Information Theory Applications, San Diego (2009). Zamir R.: Lattices are everywhere. In: Proceedings of Information Theory Applications, San Diego (2009).
Metadaten
Titel
Lattices from codes over : generalization of constructions D, and
verfasst von
Eleonesio Strey
Sueli I. R. Costa
Publikationsdatum
25.10.2016
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 1/2017
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-016-0289-1

Weitere Artikel der Ausgabe 1/2017

Designs, Codes and Cryptography 1/2017 Zur Ausgabe