%A Dragoi, Vlad-Florin
%A Cayrel, Pierre-Louis
%A Colombier, Brice
%A Bucerzan, Dominic
%A Hoara, Sorin
%D 2020
%T Solving a Modified Syndrome Decoding Problem using Integer Programming
%K Syndrome decoding, integer linear programming, simplex algorithm
%X In this article, we model a variant of the well-known syndrome decoding problem as a linear optimization problem. Most common algorithms used for solving optimization problems, e.g. the simplex algorithm, fail to find a valid solution for the syndrome decoding problem over a finite field. However, our simulations prove that a slightly modified version of the syndrome decoding problem can be solved by the simplex algorithm. More precisely, the algorithm returns a valid error vector when the syndrome vector is an integer vector, i.e.,the matrix-vector multiplication, is realized over Z , instead of F q .
%U http://univagora.ro/jour/index.php/ijccc/article/view/3920
%J INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL
%0 Journal Article
%R 10.15837/ijccc.2020.5.3920
%V 15
%N 5
%@ 1841-9844
%8 2020-08-30