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

Details:

   
TitleSingleton codes.
Author(s) Natalia Dück, Karl-Heinz Zimmermann
TypeArticle in Journal
AbstractEach linear code can be described by a so-called code ideal. In order to utilize this ideal, Gröbner bases are required. Since many results depend on the chosen term order, knowledge of the universal Gröbner basis is advantageous. Singleton codes have the property that the universal Gröbner basis for their code ideals consists of all binomials associated to a codeword whose Hamming weight satisfies the Singleton bound. In this paper, properties of Singleton codes will be established and it will be examined which classical binary linear codes belong to the class of Singleton codes.
Keywordsbinary linear code, singleton bound, singleton code, universal Gröbner basis, circuit
ISSN1311-8080; 1314-3395/e
File
URL http://ijpam.eu/contents/2014-91-3/1/index.html
LanguageEnglish
JournalInt. J. Pure Appl. Math.
Volume91
Number3
Pages273--290
PublisherAcademic Publications, Sofia
Year2014
Edition0
Translation No
Refereed No
Webmaster