The following pages link to Graham H. Norton (Q231500):
Displaying 46 items.
- On sequences, rational functions and decomposition (Q499747) (← links)
- (Q917304) (redirect page) (← links)
- On the asymptotic analysis of the Euclidean algorithm (Q917305) (← links)
- Equiconnectivity and cofibrations. I (Q1163273) (← links)
- Computing GCD's by normalized division (Q1191635) (← links)
- On shortest linear recurrences (Q1286449) (← links)
- (Q1299911) (redirect page) (← links)
- On minimal realization over a finite chain ring (Q1299912) (← links)
- On Pierce-like idempotents and Hopf invariants (Q1415230) (← links)
- On the structure of linear and cyclic codes over a finite chain ring (Q1573766) (← links)
- On the key equation over a commutative ring (Q1580538) (← links)
- Lusternik--Schnirelmann category of a sphere-bundle over a sphere. (Q1811546) (← links)
- On the algebraic approximation of Lusternik--Schnirelmann category. (Q1812022) (← links)
- On the product of two primitive elements of maximal subfields of a finite field (Q1861511) (← links)
- On co-\(H\)-maps to the suspension of the projective plane (Q1862031) (← links)
- On the sum of two primitive elements of maximal subfields of a finite field. (Q1867483) (← links)
- Cyclic codes and minimal strong Gröbner bases over a principal ideal ring. (Q1870034) (← links)
- On the equivalence of codes over finite rings (Q1885353) (← links)
- The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain (Q1894579) (← links)
- On \(n\)-dimensional sequences. I (Q1911404) (← links)
- On the minimal realizations of a finite sequence (Q1911405) (← links)
- On \(n\)-dimensional sequences. I: Corrigenda (Q1918493) (← links)
- On trellis structures for Reed-Muller codes (Q1971064) (← links)
- On the annihilator ideal of an inverse form: addendum (Q2280313) (← links)
- On the annihilator ideal of an inverse form (Q2397158) (← links)
- (Q2741415) (← links)
- Strong Gröbner bases for polynomials over a principal ideal ring (Q2777726) (← links)
- Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound (Q2784499) (← links)
- Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence (Q3199325) (← links)
- (Q3832627) (← links)
- Precise Analyses of the Right- and Left-Shift Greatest Common Divisor Algorithms for $GF(q)[x]$ (Q3833621) (← links)
- (Q4217882) (← links)
- The n-dimensional key equation and a decoding application (Q4307292) (← links)
- (Q4500975) (← links)
- On the Hamming distance of linear codes over a finite chain ring (Q4503568) (← links)
- Gröbner bases and products of coefficient rings (Q4532584) (← links)
- On a family of Abelian codes and their state complexities (Q4544478) (← links)
- Some decoding applications of minimal realization (Q4608497) (← links)
- (Q4721647) (← links)
- (Q4732508) (← links)
- Analysis of sliding window decorrelation in DS-CDMA mobile radio (Q4763971) (← links)
- New properties of convolutional codes and some applications to communication systems (Q4763977) (← links)
- (Q4945364) (← links)
- Minimal Polynomial Algorithms for Finite Sequences (Q5281314) (← links)
- Matrix-product codes over \(\mathbb{F}_q\) (Q5956428) (← links)
- Lower bounds on the state complexity of geometric Goppa codes (Q5959836) (← links)
