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

Details:

   
TitleEvaluation codes from order domain theory
Author(s) Henning E. Andersen, Olav Geil
TypeArticle in Journal
AbstractThe celebrated Feng–Rao bound estimates the minimum distance of codes defined by means of their parity check matrices. From the Feng–Rao bound it is clear how to improve a large family of codes by leaving out certain rows in their parity check matrices. In this paper we derive a simple lower bound on the minimum distance of codes defined by means of their generator matrices. From our bound it is clear how to improve a large family of codes by adding certain rows to their generator matrices. The new bound is very much related to the Feng–Rao bound as well as to Shibuya and Sakaniwa
KeywordsAffine variety code, Evaluation code, Feng–Rao bound, Footprint
ISSN1071-5797
URL http://www.sciencedirect.com/science/article/pii/S1071579706000955
LanguageEnglish
JournalFinite Fields and Their Applications
Volume14
Number1
Pages92 - 123
Year2008
Edition0
Translation No
Refereed No
Webmaster