Construction of divisible formal weight enumerators and extremal polynomials not satisfying the Riemann hypothesis
The formal weight enumerators were first introduced by M. Ozeki. They form a ring of invariant polynomials which is similar to that of the weight enumerators of Type II codes. Later, the zeta functions for linear codes were discovered and their theory was developed by I. Duursma. It was generalized...
Saved in:
Published in | arXiv.org |
---|---|
Main Author | |
Format | Paper |
Language | English |
Published |
Ithaca
Cornell University Library, arXiv.org
21.05.2018
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!