Graham H. Norton

According to our database, Graham H. Norton authored at least 36 papers between 1985 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

On Rueppel's Linear Complexity Conjecture.

Graham H. Norton

CoRR, 2023

2022

A Note on the Games-Chan Algorithm.

Graham H. Norton

CoRR, 2022

2019

On the annihilator ideal of an inverse form: addendum.

Graham H. Norton

Appl. Algebra Eng. Commun. Comput., 2019

2018

On the Annihilator Ideal of an Inverse Form. A Simplification.

Graham H. Norton

CoRR, 2018

2017

On the annihilator ideal of an inverse form.

Graham H. Norton

Appl. Algebra Eng. Commun. Comput., 2017

2015

On sequences, rational functions and decomposition.

Graham H. Norton

Appl. Algebra Eng. Commun. Comput., 2015

2011

On Sequences with a Perfect Linear Complexity Profile

Graham H. Norton

CoRR, 2011

2010

Minimal polynomial algorithms for finite sequences.

Graham H. Norton

IEEE Trans. Inf. Theory, 2010

Bézout Identities Associated to a Finite Sequence

Graham H. Norton

CoRR, 2010

The Berlekamp-Massey Algorithm via Minimal Polynomials

Graham H. Norton

CoRR, 2010

2002

Lower Bounds on the State Complexity of Geometric Goppa Codes.

Tim Blackmore, Graham H. Norton

Des. Codes Cryptogr., 2002

2001

On a family of Abelian codes and their state complexities.

Tim Blackmore, Graham H. Norton

IEEE Trans. Inf. Theory, 2001

Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound.

Tim Blackmore, Graham H. Norton

SIAM J. Discret. Math., 2001

Strong Gröbner bases and cyclic codes over a finite-chain ring.

Graham H. Norton, Ana Salagean

Electron. Notes Discret. Math., 2001

Matrix-Product Codes over F_q.

Tim Blackmore, Graham H. Norton

Appl. Algebra Eng. Commun. Comput., 2001

2000

On the Hamming distance of linear codes over a finite chain ring.

Graham H. Norton, Ana Salagean

IEEE Trans. Inf. Theory, 2000

On the Key Equation Over a Commutative Ring.

Graham H. Norton, Ana Salagean-Mandache

Des. Codes Cryptogr., 2000

On the Structure of Linear and Cyclic Codes over a Finite Chain Ring.

Graham H. Norton, Ana Salagean

Appl. Algebra Eng. Commun. Comput., 2000

1999

On Shortest Linear Recurrences.

Graham H. Norton

J. Symb. Comput., 1999

On Minimal Realization Over a Finite Chain Ring.

Graham H. Norton

Des. Codes Cryptogr., 1999

On Efficient Decoding of Alternant Codes over a Commutative Ring.

Graham H. Norton, Ana Salagean

Proceedings of the Cryptography and Coding, 1999

1995

A new algebraic algorithm for generating the transfer function of a trellis encoder.

K. Y. Chan, Graham H. Norton

IEEE Trans. Commun., 1995

On the Minimal Realizations of a Finite Sequence.

Graham H. Norton

J. Symb. Comput., 1995

On n-Dimensional Sequences I.

Graham H. Norton

J. Symb. Comput., 1995

The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain.

Patrick Fitzpatrick, Graham H. Norton

Appl. Algebra Eng. Commun. Comput., 1995

Some Decoding Applications of Minimal Realization.

Graham H. Norton

Proceedings of the Cryptography and Coding, 1995

1994

The n-dimensional key equation and a decoding application.

Hervé Chabanne, Graham H. Norton

IEEE Trans. Inf. Theory, 1994

1992

A near-far resistant algorithm to combat effects of fast fading in multi-user DS-CDMA systems.

S. S. H. Wijayasuriya, Graham H. Norton, Joseph P. McGeehan

Proceedings of the Third IEEE International Symposium on Personal, 1992

1991

Computing GCD's by Normalized Division.

Graham H. Norton

Appl. Algebra Eng. Commun. Comput., 1991

1990

Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence.

Patrick Fitzpatrick, Graham H. Norton

IEEE Trans. Inf. Theory, 1990

On the Asymptotic Analysis of the Euclidean Algorithm.

Graham H. Norton

J. Symb. Comput., 1990

Stewart varieties: a direct algebraic model for Stewart platforms.

Jean-Pierre Dedieu, Graham H. Norton

SIGSAM Bull., 1990

1989

Precise Analyses of the Right- and Left-Shift Greatest Common Divisor Algorithms for GF(q)[x].

Graham H. Norton

SIAM J. Comput., 1989

1988

Linear recurrence relations and an extended subresultant algorithm.

Patrick Fitzpatrick, Graham H. Norton

Proceedings of the Coding Theory and Applications, 1988

1987

A Shift-Remainder GCD Algorithm.

Graham H. Norton

Proceedings of the Applied Algebra, 1987

1985

Extending the Binary GCD Algorithm.

Graham H. Norton

Proceedings of the Algebraic Algorithms and Error-Correcting Codes, 1985