Graham H. Norton

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 7

Top Topics

Linear Complexity

Top Venues

Appl. Algebra Eng. Commun. Comput.

Publications

Graham H. Norton
On n-Dimensional Sequences. I. CoRR (2024)
Graham H. Norton
On Rueppel's Linear Complexity Conjecture. CoRR (2023)
Graham H. Norton
A Note on the Games-Chan Algorithm. CoRR (2022)
Graham H. Norton
On the annihilator ideal of an inverse form: addendum. Appl. Algebra Eng. Commun. Comput. 30 (6) (2019)
Graham H. Norton
On the Annihilator Ideal of an Inverse Form. A Simplification. CoRR (2018)
Graham H. Norton
On the annihilator ideal of an inverse form. Appl. Algebra Eng. Commun. Comput. 28 (1) (2017)
Graham H. Norton
On the Annihilator Ideal of an Inverse Form. CoRR (2017)
Graham H. Norton
On sequences, rational functions and decomposition. Appl. Algebra Eng. Commun. Comput. 26 (5) (2015)
Graham H. Norton
On Sequences, Rational Functions and Decomposition. CoRR (2015)
Graham H. Norton
On Sequences with a Perfect Linear Complexity Profile CoRR (2011)
Graham H. Norton
Minimal polynomial algorithms for finite sequences. IEEE Trans. Inf. Theory 56 (9) (2010)
Graham H. Norton
The Berlekamp-Massey Algorithm via Minimal Polynomials CoRR (2010)
Graham H. Norton
Bézout Identities Associated to a Finite Sequence CoRR (2010)
Graham H. Norton
Minimal Polynomial Algorithms for Finite Sequences CoRR (2009)
Tim Blackmore, Graham H. Norton
Lower Bounds on the State Complexity of Geometric Goppa Codes. Des. Codes Cryptogr. 25 (1) (2002)
Tim Blackmore, Graham H. Norton
Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound. SIAM J. Discret. Math. 15 (1) (2001)
Tim Blackmore, Graham H. Norton
On a family of Abelian codes and their state complexities. IEEE Trans. Inf. Theory 47 (1) (2001)
Graham H. Norton, Ana Salagean
Strong Gröbner bases and cyclic codes over a finite-chain ring. Electron. Notes Discret. Math. 6 (2001)
Tim Blackmore, Graham H. Norton
. Appl. Algebra Eng. Commun. Comput. 12 (6) (2001)
Graham H. Norton, Ana Salagean-Mandache
On the Key Equation Over a Commutative Ring. Des. Codes Cryptogr. 20 (2) (2000)
Graham H. Norton, Ana Salagean
On the Hamming distance of linear codes over a finite chain ring. IEEE Trans. Inf. Theory 46 (3) (2000)
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) (2000)
Graham H. Norton
On Shortest Linear Recurrences. J. Symb. Comput. 27 (3) (1999)
Graham H. Norton, Ana Salagean
On Efficient Decoding of Alternant Codes over a Commutative Ring. IMACC (1999)
Graham H. Norton
On Minimal Realization Over a Finite Chain Ring. Des. Codes Cryptogr. 16 (2) (1999)
Graham H. Norton
On the Minimal Realizations of a Finite Sequence. J. Symb. Comput. 20 (1) (1995)
K. Y. Chan, Graham H. Norton
A new algebraic algorithm for generating the transfer function of a trellis encoder. IEEE Trans. Commun. 43 (5) (1995)
Graham H. Norton
On n-Dimensional Sequences I. J. Symb. Comput. 20 (1) (1995)
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) (1995)
Graham H. Norton
Some Decoding Applications of Minimal Realization. IMACC (1995)
Hervé Chabanne, Graham H. Norton
The n-dimensional key equation and a decoding application. IEEE Trans. Inf. Theory 40 (1) (1994)
S. S. H. Wijayasuriya, Graham H. Norton, Joseph P. McGeehan
A near-far resistant algorithm to combat effects of fast fading in multi-user DS-CDMA systems. PIMRC (1992)
Graham H. Norton
Computing GCD's by Normalized Division. Appl. Algebra Eng. Commun. Comput. 2 (1991)
Graham H. Norton
On the Asymptotic Analysis of the Euclidean Algorithm. J. Symb. Comput. 10 (1) (1990)
Patrick Fitzpatrick, Graham H. Norton
Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence. IEEE Trans. Inf. Theory 36 (6) (1990)
Jean-Pierre Dedieu, Graham H. Norton
Stewart varieties: a direct algebraic model for Stewart platforms. SIGSAM Bull. 24 (4) (1990)
Graham H. Norton
Precise Analyses of the Right- and Left-Shift Greatest Common Divisor Algorithms for GF(q)[x]. SIAM J. Comput. 18 (3) (1989)
Patrick Fitzpatrick, Graham H. Norton
Linear recurrence relations and an extended subresultant algorithm. Coding Theory and Applications (1988)
Graham H. Norton
A Shift-Remainder GCD Algorithm. AAECC (1987)
Graham H. Norton
Extending the Binary GCD Algorithm. AAECC (1985)