On lattice constructions D and D^ from q-ary linear codes
From MaRDI portal
Publication:6594646
DOI10.46298/CM.11146MaRDI QIDQ6594646FDOQ6594646
Authors: Franciele do Carmo Silva, Ana Paula de Souza, Eleonesio Strey, Sueli I. R. Costa 
Publication date: 28 August 2024
Published in: Communications in Mathematics (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}\)
- Lattices from codes over \(\mathbb {Z}_q\): generalization of constructions \(D\), \(D'\) and \(\overline{D}\)
- Connections between Construction D and related constructions of lattices
- scientific article; zbMATH DE number 1456827
- Lattice and construction of high coding gain lattices from codes
latticescodes over ringscoding gainconstructions \(D\) and \(D^\prime\)decoding of construction \(D^\prime\)
Cites Work
- Coset codes. I. Introduction and geometrical classification
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Quaternary quadratic residue codes and unimodular lattices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Type II codes, even unimodular lattices, and invariant rings
- Some Sphere Packings in Higher Space
- Lattice-based Cryptography
- New bounds in some transference theorems in the geometry of numbers
- Title not available (Why is that?)
- Codes over \(\mathbb{Z}_{2^k}\), Gray map and self-dual codes
- Complementary Sets, Generalized Reed–Muller Codes, and Power Control for OFDM
- Limits on the hardness of lattice problems in \(\ell_{p}\) norms
- Quaternary Reed–Muller Codes
- Low-Density Parity-Check Lattices: Construction and Decoding Analysis
- New Lattice Packings of Spheres
- Connections between Construction D and related constructions of lattices
- Sphere-bound-achieving coset codes and multilevel coset codes
- Generalized Reed-Muller codes over \({\mathbb{Z}_q}\)
- A new multilevel coding method using error-correcting codes
- Hermite’s Constant and Lattice Algorithms
- Sphere Packings and Error-Correcting Codes
- Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
- On the decoding of Reed-Solomon and BCH codes over integer residue rings
- Perfect codes in the \(\ell_p\) metric
- Coding for the Lee and Manhattan Metrics With Weighing Matrices
- A decade of lattice cryptography
- Lee-metric BCH codes and their application to constrained and partial-response channels
- Lattice coding for signals and networks. A structured coding approach to quantization, modulation, and multiuser information theory. With contributions by Bobak Nazer and Yuval Kochman
- Construction of ${\BBZ}_4$-Linear Reed–Muller Codes
- Local testing of lattices
- LDPC Codes Over Rings for PSK Modulation
- Further lattice packings in high dimensions
- Error-Correction of Multidimensional Bursts
- Achieving<tex>$ 1over 2log (1+ hboxSNR)$</tex>on the AWGN Channel With Lattice Encoding and Decoding
- Kissing numbers and transference theorems from generalized tail bounds
- Lattices from codes over \(\mathbb {Z}_q\): generalization of constructions \(D\), \(D'\) and \(\overline{D}\)
- Bounds for the \(l_1\)-distance of \(q\)-ary lattices obtained via constructions \(\mathrm D\), \(\mathrm D'\) and \(\overline{\mathrm D}\)
- Lattice and construction of high coding gain lattices from codes
- Strongly perfect lattices sandwiched between Barnes-Wall lattices
- Perfect and Quasi-Perfect Codes Under the $l_{p}$ Metric
- Title not available (Why is that?)
- Advanced modern algebra. Part 1
- Classification of Some Families of Quaternary Reed–Muller Codes
- Lattices applied to coding for reliable and secure communications
- Lattice (List) Decoding Near Minkowski’s Inequality
- Decoding LDPC Codes Over Integer Residue Rings
- Efficient decoding algorithms for generalized Reed-Muller codes.
- Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels
- Performance and Complexity Analysis of Infinity-Norm Sphere-Decoding
- Multilevel Constructions: Coding, Packing and Geometric Uniformity
- On almost perfect linear Lee codes of packing radius 2
Cited In (2)
This page was built for publication: On lattice constructions \(D\) and \(D^\prime\) from \(q\)-ary linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6594646)
