|Title||Algebraic structure of the minimal support codewords set of some linear codes|
|Author(s)|| Irene Márquez-Corbella, Edgar Martinez-Moro|
|Type||Article in Journal|
|Abstract||Abstract It has been widely known that complete decoding for binary linear|
codes can be regarded as a linear integer programming problem with binary arithmetic conditions. Conti and Traverso  have proposed an algorithm which uses Gröbner bases to solve integer programming with ordinary integer arithmetic conditions. Ikegami and Kaji  extended the Conti-Traverso algorithm to solve integer programming with modulo arithmetic conditions. It is natural to consider for those problems the Graver basis associated to them which turns out to be the minimal cycles of the matroid associated to the code, i.e. minimal support codewords in the binary case and its geometry. This provides us a universal test set for the programs considered.
|Keywords||Minimal codewords, modular/integer programming, Gröbner basis|
|Journal||Advances in Mathematics of Communications|