Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleAlgebraic structure of the minimal support codewords set of some linear codes
Author(s) Irene Márquez-Corbella, Edgar Martinez-Moro
TypeArticle in Journal
AbstractAbstract 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 [9] have proposed an algorithm which uses Gröbner bases to solve integer programming with ordinary integer arithmetic conditions. Ikegami and Kaji [12] 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.
KeywordsMinimal codewords, modular/integer programming, Gröbner basis
ISSN1930-5346
URL http://aimsciences.org/journals/displayArticlesnew.jsp?paperID=6177
LanguageEnglish
JournalAdvances in Mathematics of Communications
Volume5
Number2
Pages233-244
Year2011
Edition0
Translation No
Refereed No
Webmaster