review-article

Review of algebraic function fields and codes by Henning Stichtenoth

Author:

Swastik KoppartyAuthors Info & Claims

ACM SIGACT News, Volume 42, Issue 2

Pages 19 - 24

https://doi.org/10.1145/1998037.1998043

Published: 10 June 2011 Publication History

Get Access

References

[1]

Robin Hartshorne. Algebraic geometry. Springer-Verlag, New York, 1977. Graduate Texts in Mathematics, No. 52.

Crossref

Google Scholar

[2]

J. W. P. Hirschfeld, G. Korchmáros, and F. Torres. Algebraic curves over a finite field. Princeton Series in Applied Mathematics. Princeton University Press, Princeton, NJ, 2008.

Google Scholar

[3]

Carlos Moreno. Algebraic curves over finite fields, volume 97 of Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge, 1991.

Google Scholar

[4]

Michael Rosen. Number theory in function fields, volume 210 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2002.

Google Scholar

[5]

W. Schmidt. Equations over finite fields. In Lecture Notes in Mathematics, pages 53--6. Springer Verlag, 1976.

Google Scholar

[6]

M. A. Tsfasman and S. G. Vlădut. Algebraic-geometric codes, volume 58 of Mathematics and its Applications (Soviet Series). Kluwer Academic Publishers Group, Dordrecht, 1991. Translated from the Russian by the authors.

Digital Library

Google Scholar

[7]

André Weil. Basic number theory. Die Grundlehren der mathematischen Wissenschaften, Band 144. Springer-Verlag New York, Inc., New York, 1967.

Google Scholar

Index Terms

Review of algebraic function fields and codes by Henning Stichtenoth

Recommendations

Excellent nonlinear codes from algebraic function fields

The Gilbert-Varshamov (GV) bound for asymptotic families of codes over F_q has been improved by Tsfasman, Vla&breve;dut$80, and Zink (TVZ) in 1982, and only recently further improvements have been obtained by Xing, Elkies, and Niederreiter-Özbudak, ...
On Perfect and Reed–Muller Codes over Finite Fields
Abstract
We consider error-correcting codes over a finite field with elements (-ary codes). We study relations between single-error-correcting -ary perfect codes and -ary Reed–Muller codes. For we find parameters of affine Reed–Muller codes of order . We ...
Algebraic-geometry codes, one-point codes, and evaluation codes
Abstract
One-point codes are those algebraic-geometry codes for which the associated divisor is a non-negative multiple of a single point. Evaluation codes were defined in order to give an algebraic generalization of both one-point algebraic-geometry codes ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGACT News Volume 42, Issue 2

June 2011

97 pages

ISSN:0163-5700

DOI:10.1145/1998037

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 June 2011

Published in SIGACT Volume 42, Issue 2

Check for updates

Qualifiers

Review-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
145
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)1

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

Excellent nonlinear codes from algebraic function fields

On Perfect and Reed–Muller Codes over Finite Fields

Algebraic-geometry codes, one-point codes, and evaluation codes