Graham H. Norton

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