Construction-D lattice from Garcia–Stichtenoth tower code
From MaRDI portal
Publication:6499093
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
Cites work
- scientific article; zbMATH DE number 1488179 (Why is no real title available?)
- scientific article; zbMATH DE number 1775409 (Why is no real title available?)
- A decade of lattice cryptography
- A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
- Algebraic soft-decision decoding of reed-solomon codes
- Lattice (List) Decoding Near Minkowski’s Inequality
- Lattices with exponentially large kissing numbers
- List-decoding Barnes-Wall lattices
- New Lattice Packings of Spheres
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- On the asymptotic behaviour of some towers of function fields over finite fields
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes
- Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices
- Some extreme forms defined in terms of Abelian groups
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)
