scientific article
From MaRDI portal
Publication:2741436
zbMath0991.94515MaRDI QIDQ2741436
Chris Charnes, Bruno Martin, Patrick Solé
Publication date: 15 October 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography ⋮ A non-commutative cryptosystem based on quaternion algebras
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- On Lovász' lattice reduction and the nearest lattice point problem
- Maximality of the cycle code of a graph
- Integer Programming with a Fixed Number of Variables
- Generalized minimum-distance decoding of Euclidean-space codes and lattices
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
- Coset codes. II. Binary lattices and related codes
- On the complexity of some coding problems (Corresp.)
- Trellis shaping
- Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices
- The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions
- Block Reduced Lattice Bases and Successive Minima
- A universal lattice code decoder for fading channels
- Matching, Euler tours and the Chinese postman
- Covering properties of convolutional codes and associated lattices
- Density/length profiles and trellis complexity of lattices
- Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice
This page was built for publication:
