Log In Sign Up

Quantum Reduction of Finding Short Code Vectors to the Decoding Problem

by   Thomas Debris-Alazard, et al.

We give a quantum reduction from finding short codewords in a random linear code to decoding for the Hamming metric. This is the first time such a reduction (classical or quantum) has been obtained. Our reduction adapts to linear codes Stehlé-Steinfield-Tanaka-Xagawa' re-interpretation of Regev's quantum reduction from finding short lattice vectors to solving the Closest Vector Problem. The Hamming metric is a much coarser metric than the Euclidean metric and this adaptation has needed several new ingredients to make it work. For instance, in order to have a meaningful reduction it is necessary in the Hamming metric to choose a very large decoding radius and this needs in many cases to go beyond the radius where decoding is unique. Another crucial step for the analysis of the reduction is the choice of the errors that are being fed to the decoding algorithm. For lattices, errors are usually sampled according to a Gaussian distribution. However, it turns out that the Bernoulli distribution (the analogue for codes of the Gaussian) is too much spread out and can not be used for the reduction with codes. Instead we choose here the uniform distribution over errors of a fixed weight and bring in orthogonal polynomials tools to perform the analysis and an additional amplitude amplification step to obtain the aforementioned result.


page 1

page 2

page 3

page 4


Information set decoding of Lee-metric codes over finite rings

Information set decoding (ISD) algorithms are the best known procedures ...

Information Set Decoding for Lee-Metric Codes using Restricted Balls

The Lee metric syndrome decoding problem is an NP-hard problem and sever...

Decoding High-Order Interleaved Rank-Metric Codes

This paper presents an algorithm for decoding homogeneous interleaved co...

On List Decoding of Insertion and Deletion Errors

Insertion and deletion (Insdel for short) errors are synchronization err...

Generic Decoding in the Cover Metric

In this paper, we study the hardness of decoding a random code endowed w...

Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius

We address the problem of decoding Gabidulin codes beyond their error-co...

Deterministic Sampling Decoding: Where Sphere Decoding Meets Lattice Gaussian Distribution

In this paper, the paradigm of sphere decoding (SD) based on lattice Gau...