Euclidean weights of codes from elliptic curves over rings
DOI10.1090/S0002-9947-00-02637-4zbMath0963.94047MaRDI QIDQ4505912
Judy L. Walker, José Felipe Voloch
Publication date: 3 October 2000
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
elliptic curvesestimatesalgebraic geometry codescodes over ringsfinite local ringsexponential sums along curvessequences with good correlation properties
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Exponential sums (11T23) Elliptic curves over local fields (11G07)
Related Items (11)
Cites Work
- Unnamed Item
- Unnamed Item
- Algebraic function fields and codes
- An approximation property for Teichmüller points
- Geometry of \(p\)-jets
- Frobenius and the Hodge filtration (estimates)
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- An updated table of minimum-distance bounds for binary linear codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- The Nordstrom-Robinson code is algebraic-geometric
- An upper bound for Weil exponential sums over Galois rings and applications
- Formal moduli for one-parameter formal Lie groups
This page was built for publication: Euclidean weights of codes from elliptic curves over rings