| 2007 |
|---|
| 17 | EE | Henning Stichtenoth:
Nice Codes from Nice Curves.
AAECC 2007: 48-49 |
| 2006 |
|---|
| 16 | EE | Henning Stichtenoth:
Transitive and self-dual codes attaining the Tsfasman-Vla/spl breve/dut$80-Zink bound.
IEEE Transactions on Information Theory 52(5): 2218-2224 (2006) |
| 2005 |
|---|
| 15 | EE | Henning Stichtenoth,
Chaoping Xing:
Excellent nonlinear codes from algebraic function fields.
IEEE Transactions on Information Theory 51(11): 4044-4046 (2005) |
| 2004 |
|---|
| 14 | | Gary L. Mullen,
Alain Poli,
Henning Stichtenoth:
Finite Fields and Applications, 7th International Conference, Fq7, Toulouse, France, May 5-9, 2003, Revised Papers
Springer 2004 |
| 2003 |
|---|
| 13 | | Ferruh Özbudak,
Henning Stichtenoth:
Constructing linear unequal error protection codes from algebraic curves.
IEEE Transactions on Information Theory 49(6): 1523-1526 (2003) |
| 2002 |
|---|
| 12 | EE | 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 |
| 11 | EE | 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 |
|---|
| 10 | | 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 Transactions on Information Theory 47(4): 1613-1619 (2001) |
| 9 | | 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 Transactions on Information Theory 47(6): 2225-2241 (2001) |
| 1999 |
|---|
| 8 | | Ferruh Özbudak,
Henning Stichtenoth:
Constructing codes from algebraic curves.
IEEE Transactions on Information Theory 45(7): 2502-2505 (1999) |
| 1995 |
|---|
| 7 | | A. G. Garcia,
Henning Stichtenoth:
Algebraic function fields over finite fields with many rational places.
IEEE Transactions on Information Theory 41(6): 1548-1563 (1995) |
| 1994 |
|---|
| 6 | | Henning Stichtenoth,
Conny Voss:
Generalized Hamming weights of trace codes.
IEEE Transactions on Information Theory 40(2): 554- (1994) |
| 5 | | Kyeongcheol Yang,
P. Vijay Kumar,
Henning Stichtenoth:
On the weight hierarchy of geometric Goppa codes.
IEEE Transactions on Information Theory 40(3): 913- (1994) |
| 1990 |
|---|
| 4 | | Johan P. Hansen,
Henning Stichtenoth:
Group Codes on Certain Algebraic Curves with Many Rational Points.
Appl. Algebra Eng. Commun. Comput. 1: 67-77 (1990) |
| 3 | | Henning Stichtenoth:
On the dimension of subfield subcodes.
IEEE Transactions on Information Theory 36(1): 90-93 (1990) |
| 1989 |
|---|
| 2 | EE | Henning Stichtenoth:
Which extended goppa codes are cyclic?
J. Comb. Theory, Ser. A 51(2): 205-220 (1989) |
| 1988 |
|---|
| 1 | | Henning Stichtenoth:
A note on Hermitian codes over GF(q2).
IEEE Transactions on Information Theory 34(5): 1345- (1988) |
