Abstract
In this paper, by using a relation between binomial ideal and submodules of ℤn in , a submodule associated with the integer programming (IP) problem is defined. By computing the reduced Gröbner 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.
Original language | English |
---|---|
Article number | 6777393 |
Pages (from-to) | 857-860 |
Number of pages | 4 |
Journal | IEEE Communications Letters |
Volume | 18 |
Issue number | 5 |
DOIs | |
State | Published - May 2014 |
Keywords
- group code
- Gröbner basis
- Integer programming
- ℤ-module