Graham H. Norton - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2019

On the annihilator ideal of an inverse form: addendumGraham H. Norton. aaecc, 30(6):491-507, 2019. [doi]

2017

On the annihilator ideal of an inverse formGraham H. Norton. aaecc, 28(1):31-78, 2017. [doi]

2015

On sequences, rational functions and decompositionGraham H. Norton. aaecc, 26(5):427-463, 2015. [doi]

2010

Minimal polynomial algorithms for finite sequencesGraham H. Norton. TIT, 56(9):4643-4645, 2010. [doi]

2002

Lower Bounds on the State Complexity of Geometric Goppa CodesTim Blackmore, Graham H. Norton. dcc, 25(1):95-115, 2002.

2001

Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP BoundTim Blackmore, Graham H. Norton. siamdm, 15(1):14-40, 2001. [doi]

On a family of Abelian codes and their state complexitiesTim Blackmore, Graham H. Norton. TIT, 47(1):355-361, 2001.

Matrix-Product Codes over F::q::Tim Blackmore, Graham H. Norton. aaecc, 12(6):477-500, 2001. [doi]

Strong Gröbner bases and cyclic codes over a finite-chain ringGraham H. Norton, Ana Salagean. endm, 6:240-250, 2001. [doi]

2000

On the Key Equation Over a Commutative RingGraham H. Norton, Ana Salagean-Mandache. dcc, 20(2):125-141, 2000.

On the Structure of Linear and Cyclic Codes over a Finite Chain RingGraham H. Norton, Ana Salagean. aaecc, 10(6):489-506, 2000. [doi]

On the Hamming distance of linear codes over a finite chain ringGraham H. Norton, Ana Salagean. TIT, 46(3):1060-1067, 2000.

1999

On Shortest Linear RecurrencesGraham H. Norton. JSC, 27(3):325-349, 1999.

On Minimal Realization Over a Finite Chain RingGraham H. Norton. dcc, 16(2):161-178, 1999.

On Efficient Decoding of Alternant Codes over a Commutative RingGraham H. Norton, Ana Salagean. ima 1999: 173-178 [doi]

1995

A new algebraic algorithm for generating the transfer function of a trellis encoderK. Y. Chan, Graham H. Norton. tcom, 43(5):1866-1867, 1995. [doi]

The Berlekamp-Massey Algorithm and Linear Recurring Sequences Over a Factorial DomainPatrick Fitzpatrick, Graham H. Norton. aaecc, 6(4/5):309-324, 1995. [doi]

Some Decoding Applications of Minimal RealizationGraham H. Norton. ima 1995: 53-62

On the Minimal Realizations of a Finite SequenceGraham H. Norton. JSC, 20(1):93-115, 1995.

On n-Dimensional Sequences IGraham H. Norton. JSC, 20(1):71-92, 1995.

1994

The n-dimensional key equation and a decoding applicationHervé Chabanne, Graham H. Norton. TIT, 40(1):200, 1994.

1992

A near-far resistant algorithm to combat effects of fast fading in multi-user DS-CDMA systemsS. S. H. Wijayasuriya, Graham H. Norton, J. P. McGeehan. pimrc 1992: 645-649 [doi]

1991

Computing GCD s by Normalized DivisionGraham H. Norton. aaecc, 2:275-295, 1991.

1990

Stewart varieties: a direct algebraic model for Stewart platformsJean-Pierre Dedieu, Graham H. Norton. cca, 24(4):42-59, 1990. [doi]

Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequencePatrick Fitzpatrick, Graham H. Norton. TIT, 36(6):1480, 1990.

On the Asymptotic Analysis of the Euclidean AlgorithmGraham H. Norton. JSC, 10(1):53-58, 1990.

1989

Precise Analyses of the Right- and Left-Shift Greatest Common Divisor Algorithms for GF(q)[x]Graham H. Norton. SICOMP, 18(3):608-624, 1989.

1988

Linear recurrence relations and an extended subresultant algorithmPatrick Fitzpatrick, Graham H. Norton. coding 1989: 232-243

1987

A Shift-Remainder GCD AlgorithmGraham H. Norton. AAECC 1989: 350-356

1985

Extending the Binary GCD AlgorithmGraham H. Norton. AAECC 1986: 363-372

Sign in or sign up to see more results.

runs on WebDSL