Linear recurrence relations and an extended subresultant algorithm. - Patrick Fitzpatrick; Graham H. Norton (Coding Theory and Applications, 1988)

An improved systolic extended Euclidean algorithm for Reed-Solomon decoding: design and implementation. - Rory Doyle; Patrick Fitzpatrick; John Nelson (ASAP, 1990)

Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence. - Patrick Fitzpatrick; Graham H. Norton (IEEE Trans. Inf. Theory, 1990)

Fault tolerant matrix triangularization and solution of linear systems of equations. - Patrick Fitzpatrick; Colin C. Murphy (ASAP, 1992)

A Gröbner Basis Technique for Inverting Mulitvariable Hensel Codes. - Patrick Fitzpatrick; J. Flynn (J. Symb. Comput., 1992)

On fault tolerant matrix decomposition. - Patrick Fitzpatrick (J. VLSI Signal Process., 1994)

The Berlekamp-Massey algorithm and linear recurring sequences over a factorial domain. - Patrick Fitzpatrick; Graham H. Norton (Appl. Algebra Eng. Commun. Comput., 1995)

On the key equation. - Patrick Fitzpatrick (IEEE Trans. Inf. Theory, 1995)

On the scalar rational interpolation problem. - Patrick Fitzpatrick (Math. Control. Signals Syst., 1996)

Solving a Multivariable Congruence by Change of Term Order. - Patrick Fitzpatrick (J. Symb. Comput., 1997)

Extending Backward Error Assertions to Tolerance of Large Errors in Floating Point Computations. - Patrick Fitzpatrick (IEEE Trans. Computers, 1997)

Comparison of Two Algorithms for Decoding Alternant Codes. - Patrick Fitzpatrick; Sylvia M. Jennings (Appl. Algebra Eng. Commun. Comput., 1998)

Fault Tolerant Faddeeva Algorithm. - Maura P. Connolly; Patrick Fitzpatrick (J. Parallel Distributed Comput., 1998)

FPGA Design Trade-Offs for Solving the Key Equation in Reed-Solomon Decoding. - Emanuel M. Popovici; Patrick Fitzpatrick; Colin C. Murphy (FPL, 1999)

Algebraic structure of quasicyclic codes. - Kristine Lally; Patrick Fitzpatrick (Discret. Appl. Math., 2001)

The number of inequivalent irreducible Goppa codes. - Patrick Fitzpatrick; John A. Ryan (Electron. Notes Discret. Math., 2001)

Gröbner Bases over Galois Rings with an Application to Decoding Alternant Codes. - Eimear Byrne; Patrick Fitzpatrick (J. Symb. Comput., 2001)

Fully Parameterizable Elliptic Curve Cryptography Processor over GF(2). - Tim Kerins; Emanuel M. Popovici; William P. Marnane; Patrick Fitzpatrick (FPL, 2002)

Hamming metric decoding of alternant codes over Galois rings. - Eimear Byrne; Patrick Fitzpatrick (IEEE Trans. Inf. Theory, 2002)

Algorithm and architecture for a Galois field multiplicative arithmetic processor. - Emanuel M. Popovici; Patrick Fitzpatrick (IEEE Trans. Inf. Theory, 2003)

Quasicyclic irreducible Goppa codes. - John A. Ryan; Patrick Fitzpatrick (ISIT, 2004)

Direct Division in Factor Rings. - Patrick Fitzpatrick; Christopher Wolf (IACR Cryptol. ePrint Arch., 2004)

Enumeration of inequivalent irreducible Goppa codes. - John A. Ryan; Patrick Fitzpatrick (Discret. Appl. Math., 2006)

Bounds on Codes Derived by Counting Components in Varshamov Graphs. - Katie O'Brien; Patrick Fitzpatrick (Des. Codes Cryptogr., 2006)

Gröbner basis approach to list decoding of algebraic geometry codes. - Henry O'Keeffe; Patrick Fitzpatrick (Appl. Algebra Eng. Commun. Comput., 2007)

Gröbner bases and combinatorics for binary codes. - Mijail Borges-Quintana; Miguel A. Borges-Trenard; Patrick Fitzpatrick; Edgar Martínez-Moro (Appl. Algebra Eng. Commun. Comput., 2008)

Special issue algebraic coding theory and applications. - Antonio Campillo; Patrick Fitzpatrick; Edgar Martínez-Moro; Ruud Pellikaan (J. Symb. Comput., 2010)

Williamson type Hadamard matrices with circulant components. - Patrick Fitzpatrick; Henry O'Keeffe (Discret. Math., 2023)