Complete Gröbner basis for lattice codes

02/21/2023
by   I. Álvarez-Barrientos, et al.
0

In this work, two algorithms are developed related to lattice codes. In the first one, an extended complete Gröbner basis is computed for the label code of a lattice. This basis supports all term orderings associated with a total degree order offering information about de label code of the lattice. The second one is a decoding algorithm that uses an extended complete Gröbner basis of the label code of the lattice for monomial reduction, this provides all the lattice vectors that constitute candidates for the solution of the Close Vector Problem for a given vector.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/03/2019

Faster Lattice Enumeration

A lattice reduction is an algorithm that transforms the given basis of t...
research
09/01/2020

Obtuse Lattice Bases

A lattice reduction is an algorithm that transforms the given basis of t...
research
03/03/2023

An efficient algorithm for integer lattice reduction

A lattice of integers is the collection of all linear combinations of a ...
research
11/20/2018

On compact representations of Voronoi cells of lattices

In a seminal work, Micciancio & Voulgaris (2010) described a determinist...
research
08/08/2018

Incrementally and inductively constructing basis of multiplicative dependence lattice of non-zero algebraic numbers

Let x=(x_1,x_2,...,x_n)^T be a vector of non-zero algebraic numbers, the...
research
03/15/2023

Wilson matrix kernel for lattice QCD on A64FX architecture

We study the implementation of the even-odd Wilson fermion matrix for la...
research
08/08/2018

An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers

Computing a basis for the exponent lattice of algebraic numbers is a bas...

Please sign up or login with your details

Forgot password? Click here to reset