The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Graham H. Norton: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Graham H. Norton
    Extending the Binary GCD Algorithm. [Citation Graph (0, 0)][DBLP]
    AAECC, 1985, pp:363-372 [Conf]
  2. Graham H. Norton
    A Shift-Remainder GCD Algorithm. [Citation Graph (0, 0)][DBLP]
    AAECC, 1987, pp:350-356 [Conf]
  3. 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]
  4. Graham H. Norton
    Some Decoding Applications of Minimal Realization. [Citation Graph (0, 0)][DBLP]
    IMA Conf., 1995, pp:53-62 [Conf]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. Graham H. Norton
    On Shortest Linear Recurrences. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1999, v:27, n:3, pp:325-349 [Journal]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]

  23. Minimal Polynomial Algorithms for Finite Sequences [Citation Graph (, )][DBLP]


  24. Shortest Two-way Linear Recurrences [Citation Graph (, )][DBLP]


  25. The Berlekamp-Massey Algorithm via Minimal Polynomials [Citation Graph (, )][DBLP]


  26. Bézout Identities Associated to a Finite Sequence [Citation Graph (, )][DBLP]


Search in 0.875secs, Finished in 0.876secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002