科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, by using a relation between binomial ideal and submodules of Z(n) in [3], 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.
- 出版日期2014-5
