Construction-D lattice from Garcia–Stichtenoth tower code

DOI10.1007/S10623-023-01333-2MaRDI QIDQ6499093FDOQ6499093

Authors: Elena Kirshanova, Ekaterina Sergeevna Malygina 

Publication date: 8 May 2024

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Recommendations

• Bounds for the \(l_1\)-distance of \(q\)-ary lattices obtained via constructions \(\mathrm D\), \(\mathrm D'\) and \(\overline{\mathrm D}\)
• On lattice constructions \(D\) and \(D^\prime\) from \(q\)-ary linear codes
• Lattices from codes over \(\mathbb {Z}_q\): generalization of constructions \(D\), \(D'\) and \(\overline{D}\)
• scientific article; zbMATH DE number 1456827
• Lattice and construction of high coding gain lattices from codes

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Cites Work

• On the asymptotic behaviour of some towers of function fields over finite fields
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• Algebraic soft-decision decoding of reed-solomon codes
• New Lattice Packings of Spheres
• Title not available (Why is that?)
• A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
• List-decoding Barnes-Wall lattices
• Title not available (Why is that?)
• A decade of lattice cryptography
• Some extreme forms defined in terms of Abelian groups
• Lattices with exponentially large kissing numbers
• Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices
• Lattice (List) Decoding Near Minkowski’s Inequality
• Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes

This page was built for publication: Construction-D lattice from Garcia–Stichtenoth tower code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499093)