Abstract
We determine the actual parameters for a class of one-point codes of length 64 and 65 over F8 defined by Hansen-Stichtenoth [1]. Several codes have a minimum distance that exceeds the Feng-Rao bound. The codes with parameters [64, 5, 51], [64, 10, 42], [64, 11, 42], [64, 12, 40], [65, 5, 52], [65, 10, 43], [65, 11, 42], [65, 12, 41], and [65, 13, 40] are better than any known code.
Original language | English (US) |
---|---|
Pages (from-to) | 1351-1353 |
Number of pages | 3 |
Journal | IEEE Transactions on Information Theory |
Volume | 49 |
Issue number | 5 |
DOIs | |
State | Published - May 2003 |
Keywords
- Geometric Goppa code
- Hansen-Stichtenoth curve
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences