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

Details:

   
TitleOn the De Boer–Pellikaan method for computing minimum distance
Author(s) Ştefan O. Tohaˇneanu
TypeArticle in Journal
AbstractIf C is an [ n , k , d ] -linear code, computing its minimum distance, d , leads to deciding if certain ideals I generated by products of linear forms are Artinian or not (De Boer and Pellikaan, 1999). In this note we show that when these ideals are Artinian, then they must be powers of the maximal (irrelevant) ideal. We discuss some theoretical consequences of this result in connection to projective minimal codewords. In the end we compare the De Boer–Pellikaan method with the Migliore–Peterson method (Migliore and Peterson, 2004).
KeywordsLinear codes, Minimum distance, Hilbert polynomial, Regularity
ISSN0747-7171
URL http://www.sciencedirect.com/science/article/pii/S074771711000101X
LanguageEnglish
JournalJournal of Symbolic Computation
Volume45
Number10
Pages965 - 974
Year2010
Edition0
Translation No
Refereed No
Webmaster