On quadratic residue codes and hyperelliptic curves
For an odd prime p and each non-empty subset S⊂GF(p), consider the hyperelliptic curve X S defined by y 2 =f S (x), where f S (x) = ∏ a∈S (x-a). Using a connection between binary quadratic residue codes and hyperelliptic curves over GF(p), this paper investigates how coding theory bound...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2008-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/606 |