- Notes
(i) Titles enclosed in [ ] are refereed conference papers of
subsequent journal articles.
(ii) To create 'file.ps' from 'file.ps.Z', enter 'uncompress file.ps.Z'.
- On the complexity of finding shortest linear recurrences.
Unpublished.
.ps.Z (93KB)
.pdf
- Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.
Finite Fields and Their Applications, 9:237-249,2003.
(with A. Salagean).
.ps.Z
(107KB)
.pdf
- Gröbner bases and products of coefficient rings.
Bull. Australian Mathematical Society,
65:147-154, 2002.
(with A. Salagean).
.ps.Z
(76KB)
.pdf
- Matrix-product codes over F_q.
Applicable Algebra in Engineering, Communications and Computing,
12:477-500, 2001.
(with T.D. Blackmore)
.ps.Z
(160KB)
.pdf
- Strong Gröbner bases for polynomials over a principal ideal ring.
Bull. Australian Mathematical Society ,
64: 505-528, 2001.
(with A. Salagean).
.ps.Z
(136KB)
.pdf
- [Strong Gröbner bases and cyclic codes over a finite-chain ring]
,
Workshop on Coding and Cryptography, Paris 2001
(with A. Salagean).
Electronic Notes in Discrete Mathematics, Vol. 6, April 2001
Errata.Z
(40KB)
Errata.pdf
- Determining when the absolute state complexity of a Hermitian code
achieves its DLP bound.
SIAM J. Discrete Mathematics , 15:14-40,2001.
(with T.D. Blackmore).
Electronic Version
(195KB)
.pdf
- Lower bounds on the state complexity of geometric Goppa codes.
Designs, Codes and Cryptography , 25:95-115,2002.
(with T.D. Blackmore).
.ps.Z
(131KB)
.pdf
- On a family of abelian codes and their state complexities.
IEEE Trans. Inform. Theory,
47:355-361, 2001
(with T.D. Blackmore).
.ps.Z
(108KB)
.pdf
- On the key equation over a commutative ring.
Designs, Codes and Cryptography,
20:125-141, 2000
(with A. Salagean).
.ps.Z
(123KB)
.pdf
- [Bounds on the state complexity of geometric Goppa codes.]
IEEE Int. Symposium on Information Theory, Sorrento , p.170, 2000.
(with T.D. Blackmore).
- On the structure of linear and cyclic codes over finite chain rings.
Applicable algebra in engineering, communication and computing,
10:489-506, 2000
(with A. Salagean).
.ps.Z
(128KB)
.pdf
- On the Hamming distance of linear codes over finite chain rings.
IEEE Trans. Inform. Theory,
46:1060-1067, 2000
(with A. Salagean).
.ps.Z
(131KB)
.pdf
- On trellis structures for Reed-Muller codes.
Finite Fields and their Applications,
6:39-70, 2000
(with T.D. Blackmore).
.ps.Z
(203KB)
.pdf
- [On efficient decoding of alternant codes over a commutative ring.]
I.M.A. Conference on Coding and Cryptography (M. Walker, ed.),
Lecture Notes in Computer Science, Springer 1746, 173-179, 1999 (with A. Salagean).
.ps.Z
(63KB)
.pdf
- On minimal realization over a finite chain ring.
Designs, Codes and Cryptography,
16:161-178, 1999.
.ps.Z
(118KB). Erratum. Designs, Codes and Cryptography,
17:313, 1999.
.pdf
- On shortest linear recurrences.
J. Symbolic Computation,
27:323-347, 1999.
.ps.Z
(155KB)
.pdf
- On the state complexity of some long codes.
In R.C. Mullin and G.L.Mullen, editors, Finite Fields: Theory, Applications and Algorithms, volume 225 of Contemporary Mathematics. American Mathematical Society,
203-214, 1998
(with T.D. Blackmore).
.ps.Z
(113KB)
.pdf
- On the trellis structure of GRM codes.
In Algebraic and Combinatorial Coding Theory. Sixth International Workshop,
pages 26-29, 1998
(with T.D. Blackmore).
.ps.Z
(62KB)
.pdf
- On the minimal realizations of a finite sequence.
J. Symbolic Computation,
20:93-115, 1995.
.ps.Z
(139KB)
.pdf
- On n-Dimensional Sequences.I.
J. Symbolic Computation,
20:71-92, 769-770, 1995.
.ps.Z
(150KB) Corrigenda. J. Symbolic Computation,
20:769-770, 1995.
.pdf
- A new algebraic algorithm for generating the transfer function of a
trellis encoder.
IEEE Trans. Communications,
43:1866-1867, 1995
(with K.Y. Chan).
- Some decoding applications of minimal realization.
In Cryptography and Coding, volume 1025, Springer Lecture Notes in Computer Science., 53-62, 1995.
- The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain.
Applicable Algebra in Engineering, Communication and Computing,
6:309-323, 1995
(with P. Fitzpatrick).
- The n-dimensional key equation and a decoding application.
IEEE Trans. Inform. Theory,
40:200-203, 1994
(with H. Chabanne).
- The solution module (of n-dimensional sequences) of an ideal containing
$(X_1^{M_1}-1,...,X_n^{M_n}-1)$.
Fourth I.M.A. Conference on Cryptography and
Coding, (P.G.Farrell Ed.)
Dec. 1993, 315-326.
.ps.Z
(88KB)
.pdf
- Computing GCD's by normalized division.
Applicable Algebra in Engineering, Communication and Computing,
2:275-295, 1992.
- Linear recurring sequences and the path weight enumerator of a
convolutional code.
IEE Electronic Letters,
27:98-99, 1991
(with P. Fitzpatrick).
- On the asymptotic analysis of the Euclidean algorithm.
Journal of Symbolic Computation,
10:53-58, 1990.
- Finding a basis for the characteristic ideal of an n-dimensional
linear recurring sequence.
IEEE Transactions on Information Theory,
36:1480-1487, 1990
(with P. Fitzpatrick).
- A systolic version of the extended Euclidean algorithm.
International Conference on systolic arrays, Killarney. Prentice-Hall.,
pages 477-487, 1989
(with P. Fitzpatrick, J. Nelson).
- [Linear recurrence relations and an extended subresultant algorithm.]
Lecture Notes in Computer Science,
388:232-243, 1989
(with P. Fitzpatrick).
- Precise analyses of the right- and left-shift greatest common divisor algorithms for GF(q)[x].
Society for Industrial and Applied Mathematics J. Computing,
18:608-624, 1989.
- [A shift remainder gcd algorithm.]
Applied Algebra, Algebraic Algorithms and Error Correcting Codes (J. Calmet, A. Poli eds.), Springer LNCS volume 356,
pages 350-356, 1989.
- Extending the binary Euclidean algorithm.
In Algebraic Algorithms and Error Correcting Codes (J. Calmet, A. Poli eds.), Springer LNCS
volume 229, pages 363-372, 1986.