Research Interests

My research interests are in coding theory, computer algebra and discrete mathematics.


    Jeff Farr and Petr Lisonek, "Large caps with free pairs in dimensions five and six," Innovations in Incidence Geometry (2006).

    Jeff Farr and Petr Lisonek, "Caps with free pairs of points," J. Geom. 85 (2006), 35-41.

    Jeff Farr and Shuhong Gao, "Gröbner bases and generalized Padé approximation," Math. Comp. 75 (2005), 461-473. [pdf]

    Jeff Farr and Shuhong Gao, "Computing Gröbner bases for vanishing ideals of finite sets of points," , 118-127. [ps]

    Jeff Farr, Computing Gröbner bases, with applications to Padé approximation and algebraic coding theory, Ph.D. Thesis, Clemson University, 2003.

    Jeff Farr,  Stephen Hedetniemi , Renu Laskar , et al., "Gallai Theorems Involving Domination Parameters," Congressus Numerantium, 157 (2002), 149-157.  [pdf]

    Neil Calkin and Jeff Farr, "Slow Convergence of a Double-Biased Sequence," Congressus Numerantium, 159 (2002), 159-165.  [pdf]

Current Projects

    Jeff Farr, Shuhong Gao and Dan Noneaker, "Construction and Decoding of a Large Class of Random Linear Codes," in progress.

    Jeff Farr and Shuhong Gao, "A Comparison of Staggered Interleaving With Designed Interleaving," in progress.

    Jeff Farr and Petr Lisonek, "Product constructions for caps with free pairs," in progress. [abstract]

    Jeff Farr , "Caps with many free pairs," in progress.