default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenning Stichtenoth
Person information
- affiliation: Sabanci University, Istanbul, Turkey
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1993
[b1]Henning Stichtenoth:
Algebraic function fields and codes. Universitext, Springer 1993, ISBN 978-3-540-56489-8, pp. I-X, 1-260
Journal Articles
- 2021
- [j27]Nurdagül Anbar
, Henning Stichtenoth, Seher Tutdere:
Asymptotically good towers of function fields with small p-rank. Finite Fields Their Appl. 76: 101909 (2021) - 2020
- [j26]Tekgül Kalayci, Henning Stichtenoth, Alev Topuzoglu:
Permutation polynomials and factorization. Cryptogr. Commun. 12(5): 913-934 (2020) - [j25]Tekgül Kalayci, Henning Stichtenoth, Alev Topuzoglu:
Irreducible factors of a class of permutation polynomials. Finite Fields Their Appl. 63: 101647 (2020) - 2019
- [j24]Alp Bassa, Henning Stichtenoth:
Self-dual codes better than the Gilbert-Varshamov bound. Des. Codes Cryptogr. 87(1): 173-182 (2019) - 2016
- [j23]Leyla Ates, Henning Stichtenoth:
A note on short vectors in lattices from function fields. Finite Fields Their Appl. 39: 264-271 (2016) - [j22]Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth:
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. J. ACM 63(4): 32:1-32:57 (2016) - 2014
- [j21]Henning Stichtenoth:
A note on composed products of polynomials over finite fields. Des. Codes Cryptogr. 73(1): 27-32 (2014) - [j20]Alp Bassa, Peter Beelen, Arnaldo Garcia, Henning Stichtenoth:
An Improvement of the Gilbert-Varshamov Bound Over Nonprime Fields. IEEE Trans. Inf. Theory 60(7): 3859-3861 (2014) - 2013
- [j19]Nurdagül Anbar, Henning Stichtenoth:
On the number of rational points of curves over finite fields. Electron. Notes Discret. Math. 40: 21-26 (2013) - 2012
- [j18]Henning Stichtenoth, Alev Topuzoglu:
Factorization of a class of polynomials over finite fields. Finite Fields Their Appl. 18(1): 108-122 (2012) - 2011
- [j17]Henning Stichtenoth:
Curves with a prescribed number of rational points. Finite Fields Their Appl. 17(6): 552-559 (2011) - 2006
- [j16]Peter Beelen, Arnaldo Garcia, Henning Stichtenoth:
Towards a classification of recursive towers of function fields over finite fields. Finite Fields Their Appl. 12(1): 56-77 (2006) - [j15]Henning Stichtenoth:
Transitive and self-dual codes attaining the Tsfasman-Vladut-Zink bound. IEEE Trans. Inf. Theory 52(5): 2218-2224 (2006) - 2005
- [j14]Arnaldo Garcia, Henning Stichtenoth:
Asymptotics for the genus and the number of rational places in towers of function fields over a finite field. Finite Fields Their Appl. 11(3): 434-450 (2005) - [j13]Henning Stichtenoth, Chaoping Xing:
Excellent nonlinear codes from algebraic function fields. IEEE Trans. Inf. Theory 51(11): 4044-4046 (2005) - 2003
- [j12]Ferruh Özbudak, Henning Stichtenoth:
Constructing linear unequal error protection codes from algebraic curves. IEEE Trans. Inf. Theory 49(6): 1523-1526 (2003) - 2002
- [j11]Ferruh Özbudak, Henning Stichtenoth:
Note on Niederreiter-Xing's Propagation Rule for Linear Codes. Appl. Algebra Eng. Commun. Comput. 13(1): 53-56 (2002) - 2001
- [j10]Ilia Aleshnikov, P. Vijay Kumar, Kenneth W. Shum, Henning Stichtenoth:
On the splitting of places in a tower of function fields meeting the Drinfeld-Vladut bound. IEEE Trans. Inf. Theory 47(4): 1613-1619 (2001) - [j9]Kenneth W. Shum, Ilia Aleshnikov, P. Vijay Kumar, Henning Stichtenoth, Vinay Deolalikar:
A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound. IEEE Trans. Inf. Theory 47(6): 2225-2241 (2001) - 1999
- [j8]Ferruh Özbudak, Henning Stichtenoth:
Constructing codes from algebraic curves. IEEE Trans. Inf. Theory 45(7): 2502-2505 (1999) - 1995
- [j7]A. G. Garcia, Henning Stichtenoth:
Algebraic function fields over finite fields with many rational places. IEEE Trans. Inf. Theory 41(6): 1548-1563 (1995) - 1994
- [j6]Henning Stichtenoth, Conny Voss:
Generalized Hamming weights of trace codes. IEEE Trans. Inf. Theory 40(2): 554-558 (1994) - [j5]Kyeongcheol Yang, P. Vijay Kumar, Henning Stichtenoth:
On the weight hierarchy of geometric Goppa codes. IEEE Trans. Inf. Theory 40(3): 913-920 (1994) - 1990
- [j4]Johan P. Hansen, Henning Stichtenoth:
Group Codes on Certain Algebraic Curves with Many Rational Points. Appl. Algebra Eng. Commun. Comput. 1: 67-77 (1990) - [j3]Henning Stichtenoth:
On the dimension of subfield subcodes. IEEE Trans. Inf. Theory 36(1): 90-93 (1990) - 1989
- [j2]Henning Stichtenoth:
Which extended goppa codes are cyclic? J. Comb. Theory A 51(2): 205-220 (1989) - 1988
- [j1]Henning Stichtenoth:
A note on Hermitian codes over GF(q2). IEEE Trans. Inf. Theory 34(5): 1345-1348 (1988)
Conference and Workshop Papers
- 2013
- [c4]Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth:
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. FOCS 2013: 320-329 - 2010
- [c3]Henning Stichtenoth:
Recursive Towers of Function Fields over Finite Fields. WAIFI 2010: 1-6 - 2007
- [c2]Henning Stichtenoth:
Nice Codes from Nice Curves. AAECC 2007: 48-49 - 2002
- [c1]Wen-Ching W. Li, Hiren Maharaj, Henning Stichtenoth, Noam D. Elkies:
New Optimal Tame Towers of Function Fields over Small Finite Fields. ANTS 2002: 372-389
Parts in Books or Collections
- 2013
- [p3]Arnaldo Garcia, Henning Stichtenoth:
Introduction to function fields and curves. Handbook of Finite Fields 2013: 405-421 - [p2]Arnaldo Garcia, Henning Stichtenoth:
Rational points on curves. Handbook of Finite Fields 2013: 456-463 - [p1]Arnaldo Garcia, Henning Stichtenoth:
Towers. Handbook of Finite Fields 2013: 464-468
Editorship
- 2004
- [e1]Gary L. Mullen, Alain Poli, Henning Stichtenoth:
Finite Fields and Applications, 7th International Conference, Fq7, Toulouse, France, May 5-9, 2003, Revised Papers. Lecture Notes in Computer Science 2948, Springer 2004, ISBN 3-540-21324-4 [contents]
Informal and Other Publications
- 2017
- [i2]Alp Bassa, Henning Stichtenoth:
Self-Dual Codes better than the Gilbert-Varshamov bound. CoRR abs/1709.07221 (2017) - 2013
- [i1]Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth:
Constant rate PCPs for circuit-SAT with sublinear query complexity. Electron. Colloquium Comput. Complex. TR13 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
