 | 2002 |
|---|
| 23 |       | Tim Blackmore,
Graham H. Norton:
Lower Bounds on the State Complexity of Geometric Goppa Codes.
Des. Codes Cryptography 25(1): 95-115 (2002) |
| 2001 |
|---|
| 22 |  | Tim Blackmore,
Graham H. Norton:
Matrix-Product Codes over Fq.
Appl. Algebra Eng. Commun. Comput. 12(6): 477-500 (2001) |
| 21 | | Graham H. Norton,
Ana Salagean:
Strong Gröbner bases and cyclic codes over a finite-chain ring.
Electronic Notes in Discrete Mathematics 6: 240-250 (2001) |
| 20 | | Tim Blackmore,
Graham H. Norton:
On a family of Abelian codes and their state complexities.
IEEE Transactions on Information Theory 47(1): 355-361 (2001) |
| 19 | | Tim Blackmore,
Graham H. Norton:
Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound.
SIAM J. Discrete Math. 15(1): 14-40 (2001) |
| 2000 |
|---|
| 18 | | Graham H. Norton,
Ana Salagean:
On the Structure of Linear and Cyclic Codes over a Finite Chain Ring.
Appl. Algebra Eng. Commun. Comput. 10(6): 489-506 (2000) |
| 17 | | Graham H. Norton,
Ana Salagean-Mandache:
On the Key Equation Over a Commutative Ring.
Des. Codes Cryptography 20(2): 125-141 (2000) |
| 16 | | Graham H. Norton,
Ana Salagean:
On the Hamming distance of linear codes over a finite chain ring.
IEEE Transactions on Information Theory 46(3): 1060-1067 (2000) |
| 1999 |
|---|
| 15 | | Graham H. Norton,
Ana Salagean:
On Efficient Decoding of Alternant Codes over a Commutative Ring.
IMA Int. Conf. 1999: 173-178 |
| 14 | | Graham H. Norton:
On Minimal Realization Over a Finite Chain Ring.
Des. Codes Cryptography 16(2): 161-178 (1999) |
| 13 | | Graham H. Norton:
On Shortest Linear Recurrences.
J. Symb. Comput. 27(3): 325-349 (1999) |
| 1995 |
|---|
| 12 | | Graham H. Norton:
Some Decoding Applications of Minimal Realization.
IMA Conf. 1995: 53-62 |
| 11 | | Patrick Fitzpatrick,
Graham H. Norton:
The Berlekamp-Massey Algorithm and Linear Recurring Sequences Over a Factorial Domain.
Appl. Algebra Eng. Commun. Comput. 6(4/5): 309-324 (1995) |
| 10 | | Graham H. Norton:
On n-Dimensional Sequences I.
J. Symb. Comput. 20(1): 71-92 (1995) |
| 9 | | Graham H. Norton:
On the Minimal Realizations of a Finite Sequence.
J. Symb. Comput. 20(1): 93-115 (1995) |
| 1994 |
|---|
| 8 | | Hervé Chabanne,
Graham H. Norton:
The n-dimensional key equation and a decoding application.
IEEE Transactions on Information Theory 40(1): 200- (1994) |
| 1991 |
|---|
| 7 | | Graham H. Norton:
Computing GCD's by Normalized Division.
Appl. Algebra Eng. Commun. Comput. 2: 275-295 (1991) |
| 1990 |
|---|
| 6 | | Patrick Fitzpatrick,
Graham H. Norton:
Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence.
IEEE Transactions on Information Theory 36(6): 1480- (1990) |
| 5 | | Graham H. Norton:
On the Asymptotic Analysis of the Euclidean Algorithm.
J. Symb. Comput. 10(1): 53-58 (1990) |
| 1989 |
|---|
| 4 | | Graham H. Norton:
Precise Analyses of the Right- and Left-Shift Greatest Common Divisor Algorithms for GF(q)[x].
SIAM J. Comput. 18(3): 608-624 (1989) |
| 1988 |
|---|
| 3 | | Patrick Fitzpatrick,
Graham H. Norton:
Linear recurrence relations and an extended subresultant algorithm.
Coding Theory and Applications 1988: 232-243 |
| 1987 |
|---|
| 2 | | Graham H. Norton:
A Shift-Remainder GCD Algorithm.
AAECC 1987: 350-356 |
| 1985 |
|---|
| 1 | | Graham H. Norton:
Extending the Binary GCD Algorithm.
AAECC 1985: 363-372 |
