Henning Stichtenoth

Affiliations:
  • Sabanci University, Istanbul, Turkey


According to our database1, Henning Stichtenoth authored at least 34 papers between 1988 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Asymptotically good towers of function fields with small <i>p</i>-rank.
Finite Fields Their Appl., 2021

2020
Irreducible factors of a class of permutation polynomials.
Finite Fields Their Appl., 2020

Permutation polynomials and factorization.
Cryptogr. Commun., 2020

2019
Self-dual codes better than the Gilbert-Varshamov bound.
Des. Codes Cryptogr., 2019

2016
A note on short vectors in lattices from function fields.
Finite Fields Their Appl., 2016

2014
An Improvement of the Gilbert-Varshamov Bound Over Nonprime Fields.
IEEE Trans. Inf. Theory, 2014

A note on composed products of polynomials over finite fields.
Des. Codes Cryptogr., 2014

2013
On the number of rational points of curves over finite fields.
Electron. Notes Discret. Math., 2013

Constant rate PCPs for circuit-SAT with sublinear query complexity.
Electron. Colloquium Comput. Complex., 2013

Towers.
Proceedings of the Handbook of Finite Fields., 2013

Rational points on curves.
Proceedings of the Handbook of Finite Fields., 2013

Introduction to function fields and curves.
Proceedings of the Handbook of Finite Fields., 2013

2012
Factorization of a class of polynomials over finite fields.
Finite Fields Their Appl., 2012

2011
Curves with a prescribed number of rational points.
Finite Fields Their Appl., 2011

2010
Recursive Towers of Function Fields over Finite Fields.
Proceedings of the Arithmetic of Finite Fields, Third International Workshop, 2010

2007
Nice Codes from Nice Curves.
Proceedings of the Applied Algebra, 2007

2006
Transitive and self-dual codes attaining the Tsfasman-Vladut-Zink bound.
IEEE Trans. Inf. Theory, 2006

Towards a classification of recursive towers of function fields over finite fields.
Finite Fields Their Appl., 2006

2005
Excellent nonlinear codes from algebraic function fields.
IEEE Trans. Inf. Theory, 2005

Asymptotics for the genus and the number of rational places in towers of function fields over a finite field.
Finite Fields Their Appl., 2005

2003
Constructing linear unequal error protection codes from algebraic curves.
IEEE Trans. Inf. Theory, 2003

2002
Note on Niederreiter-Xing's Propagation Rule for Linear Codes.
Appl. Algebra Eng. Commun. Comput., 2002

New Optimal Tame Towers of Function Fields over Small Finite Fields.
Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

2001
A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound.
IEEE Trans. Inf. Theory, 2001

On the splitting of places in a tower of function fields meeting the Drinfeld-Vladut bound.
IEEE Trans. Inf. Theory, 2001

1999
Constructing codes from algebraic curves.
IEEE Trans. Inf. Theory, 1999

1995
Algebraic function fields over finite fields with many rational places.
IEEE Trans. Inf. Theory, 1995

1994
On the weight hierarchy of geometric Goppa codes.
IEEE Trans. Inf. Theory, 1994

Generalized Hamming weights of trace codes.
IEEE Trans. Inf. Theory, 1994

1993
Algebraic function fields and codes.
Universitext, Springer, ISBN: 978-3-540-56489-8, 1993

1990
On the dimension of subfield subcodes.
IEEE Trans. Inf. Theory, 1990

Group Codes on Certain Algebraic Curves with Many Rational Points.
Appl. Algebra Eng. Commun. Comput., 1990

1989
Which extended goppa codes are cyclic?
J. Comb. Theory A, 1989

1988
A note on Hermitian codes over GF(q<sup>2</sup>).
IEEE Trans. Inf. Theory, 1988


  Loading...