Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

Given an error-correcting code over strings of length n and an arbitrary input string also of
length n, the list decoding problem is that of finding all codewords within a specified …

We show that the shortest vector problem in lattices with La norm is NP-hard for randomized
reductions. Moreover we also show that there is an absolute constant E> 0 so that to find a …

A polynomial-time soft-decision decoding algorithm for Reed-Solomon codes is developed.
This list-decoding algorithm is algebraic in nature and builds upon the interpolation …

Passive stereo vision is widely used as a range sensing technology in robots, but suffers
from dropouts: areas of low texture where stereo matching fails. By supplementing a stereo …

Classification Algorithms for Codes and Designs Page 1 Algorithms and Computation in
Mathematics Volume 15 ฀ Classification Algorithms for Codes and Designs Classification …

In this paper, we propose two new generic attacks on the rank syndrome decoding (RSD)
problem. Let C be a random [n, k] rank code over GF (qm) and let y= x+ e be a received …

Abstract The Chinese Remainder Theorem states that a positive integer m is uniquely
specified by its remainder mod& k relatively prime integers pl,, p*, provided m< n:=, p;. Thus …

We show that given oracle access to a subroutine which returns approximate closest vectors
in a lattice, one may find in polynomial time approximate shortest vectors in a lattice. The …

We give a randomized reduction for the Rank Syndrome Decoding problem and Rank
Minimum Distance problem for rank codes over extension fields. Our results are based on …