default search action
Graham H. Norton
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i10]Graham H. Norton:
On n-Dimensional Sequences. I. CoRR abs/2405.04022 (2024) - 2023
- [i9]Graham H. Norton:
On Rueppel's Linear Complexity Conjecture. CoRR abs/2305.00405 (2023) - 2022
- [i8]Graham H. Norton:
A Note on the Games-Chan Algorithm. CoRR abs/2209.00148 (2022)
2010 – 2019
- 2019
- [j24]Graham H. Norton:
On the annihilator ideal of an inverse form: addendum. Appl. Algebra Eng. Commun. Comput. 30(6): 491-507 (2019) - 2018
- [i7]Graham H. Norton:
On the Annihilator Ideal of an Inverse Form. A Simplification. CoRR abs/1805.03995 (2018) - 2017
- [j23]Graham H. Norton:
On the annihilator ideal of an inverse form. Appl. Algebra Eng. Commun. Comput. 28(1): 31-78 (2017) - [i6]Graham H. Norton:
On the Annihilator Ideal of an Inverse Form. CoRR abs/1710.07731 (2017) - 2015
- [j22]Graham H. Norton:
On sequences, rational functions and decomposition. Appl. Algebra Eng. Commun. Comput. 26(5): 427-463 (2015) - [i5]Graham H. Norton:
On Sequences, Rational Functions and Decomposition. CoRR abs/1502.06152 (2015) - 2011
- [i4]Graham H. Norton:
On Sequences with a Perfect Linear Complexity Profile. CoRR abs/1108.4224 (2011) - 2010
- [j21]Graham H. Norton:
Minimal polynomial algorithms for finite sequences. IEEE Trans. Inf. Theory 56(9): 4643-4645 (2010) - [i3]Graham H. Norton:
The Berlekamp-Massey Algorithm via Minimal Polynomials. CoRR abs/1001.1597 (2010) - [i2]Graham H. Norton:
Bézout Identities Associated to a Finite Sequence. CoRR abs/1002.0179 (2010)
2000 – 2009
- 2009
- [i1]Graham H. Norton:
Minimal Polynomial Algorithms for Finite Sequences. CoRR abs/0911.0130 (2009) - 2002
- [j20]Tim Blackmore, Graham H. Norton:
Lower Bounds on the State Complexity of Geometric Goppa Codes. Des. Codes Cryptogr. 25(1): 95-115 (2002) - 2001
- [j19]Tim Blackmore, Graham H. Norton:
Matrix-Product Codes over Fq. Appl. Algebra Eng. Commun. Comput. 12(6): 477-500 (2001) - [j18]Graham H. Norton, Ana Salagean
:
Strong Gröbner bases and cyclic codes over a finite-chain ring. Electron. Notes Discret. Math. 6: 240-250 (2001) - [j17]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): 14-40 (2001) - [j16]Tim Blackmore, Graham H. Norton:
On a family of Abelian codes and their state complexities. IEEE Trans. Inf. Theory 47(1): 355-361 (2001) - 2000
- [j15]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): 489-506 (2000) - [j14]Graham H. Norton, Ana Salagean-Mandache:
On the Key Equation Over a Commutative Ring. Des. Codes Cryptogr. 20(2): 125-141 (2000) - [j13]Graham H. Norton, Ana Salagean
On the Hamming distance of linear codes over a finite chain ring. IEEE Trans. Inf. Theory 46(3): 1060-1067 (2000)
1990 – 1999
- 1999
- [j12]Graham H. Norton:
On Minimal Realization Over a Finite Chain Ring. Des. Codes Cryptogr. 16(2): 161-178 (1999) - [j11]Graham H. Norton:
On Shortest Linear Recurrences. J. Symb. Comput. 27(3): 325-349 (1999) - [c6]Graham H. Norton, Ana Salagean:
On Efficient Decoding of Alternant Codes over a Commutative Ring. IMACC 1999: 173-178 - 1995
- [j10]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): 309-324 (1995) - [j9]Graham H. Norton:
On n-Dimensional Sequences I. J. Symb. Comput. 20(1): 71-92 (1995) - [j8]Graham H. Norton:
On the Minimal Realizations of a Finite Sequence. J. Symb. Comput. 20(1): 93-115 (1995) - [j7]K. Y. Chan, Graham H. Norton:
A new algebraic algorithm for generating the transfer function of a trellis encoder. IEEE Trans. Commun. 43(5): 1866-1867 (1995) - [c5]Graham H. Norton:
Some Decoding Applications of Minimal Realization. IMACC 1995: 53-62 - 1994
- [j6]Hervé Chabanne, Graham H. Norton:
The n-dimensional key equation and a decoding application. IEEE Trans. Inf. Theory 40(1): 200-203 (1994) - 1992
- [c4]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: 645-649 - 1991
- [j5]Graham H. Norton:
Computing GCD's by Normalized Division. Appl. Algebra Eng. Commun. Comput. 2: 275-295 (1991) - 1990
- [j4]Jean-Pierre Dedieu, Graham H. Norton:
Stewart varieties: a direct algebraic model for Stewart platforms. SIGSAM Bull. 24(4): 42-59 (1990) - [j3]Graham H. Norton:
On the Asymptotic Analysis of the Euclidean Algorithm. J. Symb. Comput. 10(1): 53-58 (1990) - [j2]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): 1480-1487 (1990)
1980 – 1989
- 1989
- [j1]Graham H. Norton:
Precise Analyses of the Right- and Left-Shift Greatest Common Divisor Algorithms for GF(q)[x]. SIAM J. Comput. 18(3): 608-624 (1989) - 1988
- [c3]Patrick Fitzpatrick, Graham H. Norton:
Linear recurrence relations and an extended subresultant algorithm. Coding Theory and Applications 1988: 232-243 - 1987
- [c2]Graham H. Norton:
A Shift-Remainder GCD Algorithm. AAECC 1987: 350-356 - 1985
- [c1]Graham H. Norton:
Extending the Binary GCD Algorithm. AAECC 1985: 363-372
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-25 20:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: