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