| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4583546 | Finite Fields and Their Applications | 2006 | 23 Pages |
Abstract
We present a lower bound for the minimum distance of certain affine variety codes which is better than the Feng–Rao bound. We also introduce a minimum distance estimate which, at times, can serve as a lower bound as well.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
