Name
Abstract | ||
|---|---|---|
. We formulate a Riemann hypothesis analogue for self-dual codes.If the hypothesis is true for a suciently large class of self-dual codes, thiswould imply an improvement of asymptotic upper bounds for the minimumdistance of self-dual codes [4]. Whether the hypothesis holds for a given codedepends on its weight enumerator. Verication for codes with a known weightenumerator suggests that the hypothesis holds in many cases, in particular forgood self-dual codes, but not for self-dual codes... |
Year | Venue | Keywords |
|---|---|---|
1999 | Codes and Association Schemes | riemann hypothesis,upper bound |
Field | DocType | Citations |
Combinatorics,Dirichlet L-function,Pure mathematics,Riemann hypothesis,Mathematics | Conference | 7 |
PageRank | References | Authors |
2.32 | 1 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Iwan M. Duursma | 1 | 279 | 26.85 |