|
Search the dblp DataBase
Henning Stichtenoth:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Wen-Ching W. Li, Hiren Maharaj, Henning Stichtenoth, Noam D. Elkies
New Optimal Tame Towers of Function Fields over Small Finite Fields. [Citation Graph (0, 0)][DBLP] ANTS, 2002, pp:372-389 [Conf]
- Johan P. Hansen, Henning Stichtenoth
Group Codes on Certain Algebraic Curves with Many Rational Points. [Citation Graph (0, 0)][DBLP] Appl. Algebra Eng. Commun. Comput., 1990, v:1, n:, pp:67-77 [Journal]
- Ferruh Özbudak, Henning Stichtenoth
Note on Niederreiter-Xing's Propagation Rule for Linear Codes. [Citation Graph (0, 0)][DBLP] Appl. Algebra Eng. Commun. Comput., 2002, v:13, n:1, pp:53-56 [Journal]
- Henning Stichtenoth
Which extended goppa codes are cyclic? [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1989, v:51, n:2, pp:205-220 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2001, v:47, n:4, pp:1613-1619 [Journal]
- A. G. Garcia, Henning Stichtenoth
Algebraic function fields over finite fields with many rational places. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:1548-1563 [Journal]
- Ferruh Özbudak, Henning Stichtenoth
Constructing codes from algebraic curves. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2502-2505 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2225-2241 [Journal]
- Henning Stichtenoth
Transitive and self-dual codes attaining the Tsfasman-Vla/spl breve/dut$80-Zink bound. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:5, pp:2218-2224 [Journal]
- Henning Stichtenoth
A note on Hermitian codes over GF(q2). [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:1345-0 [Journal]
- Henning Stichtenoth
On the dimension of subfield subcodes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:1, pp:90-93 [Journal]
- Henning Stichtenoth, Conny Voss
Generalized Hamming weights of trace codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:554-0 [Journal]
- Henning Stichtenoth, Chaoping Xing
Excellent nonlinear codes from algebraic function fields. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:4044-4046 [Journal]
- Kyeongcheol Yang, P. Vijay Kumar, Henning Stichtenoth
On the weight hierarchy of geometric Goppa codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:3, pp:913-0 [Journal]
- Ferruh Özbudak, Henning Stichtenoth
Constructing linear unequal error protection codes from algebraic curves. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2003, v:49, n:6, pp:1523-1526 [Journal]
Nice Codes from Nice Curves. [Citation Graph (, )][DBLP]
Recursive Towers of Function Fields over Finite Fields. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|