The soft-decision MLD of linear block codes, integer programming and Grobner bases

The soft-decision maximum likelihood decoding belongs to integer programming with constraint linear equations to modular arithmetic. In this paper an algorithm to solve integer programming to modulus an arbitrary positive integer using Grobner bases is proposed.