Abstract
In this paper, by using a relation between binomial ideal and submodules of Z^n in , a submodule associated with the integer programming (IP) problem is defined. By computing the reduced Grobner basis (RGB) of the submodule, the decoding problem of non-binary q-ary codes is considered as an integer program problem. Decoding complexity is investigated and the effective factors in complexity are also determined. Furthermore, an example of the decoding method for a 3-ary code is provided.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
