Publications
Book Chapter
 M. BrasAmoros, M. E. O'Sullivan, "The Key Equation for OnePoint
Codes," Chapter 3, pp. 99152, of Advances in Algebraic Geometry Codes,
E. MartinezMoro, C. Munuera, D. Ruano (eds.), World Scientific, 2008
Articles in Refereed Journals

K. Lee, M. BrasAmoros, M. E. O'Sullivan, "Unique
decoding of general AG codes," IEEE Transactions on
Information Theory, 60 (2014),no. 4, pp. 20382053.
arXiv:1210.3101
 F. Hernando, M.E. O'Sullivan,D. Ruano,
"List decoding of repeated codes," Applicable Algebra
in Engineering, Communications and Computing, 24 (2013), no. 34,
pp. 237253.
arXiv:1202.1238

F. Hernando, K. Marshall, M. E. O'Sullivan, "The
dimension of subcodesubfields of shortened generalized ReedSolomon
codes," Designs, Codes, Cryptography, 69 (2013), pp. 131142.
arXiv:1108.5475

K. Lee, M. BrasAmoros, M. E. O'Sullivan, "Unique
decoding of plane AG codes via interpolation."
IEEE Transactions on Information Theory 58 (2012), no. 6,
pp. 39413950.
arXiv:1110.6251
 K. Lee, M. E. O'Sullivan, "Algebraic SoftDecision Decoding of
Hermitian Codes" IEEE Transaction on Information
Theory 56 (2010) no. 6, pp. 25872600.
arXiv:0807.4995
 K. Lee, M. E. O'Sullivan, "List Decoding of Hermitian Codes
using Groebner Bases" Journal of Symbolic Computation, 40 (2009)
12, 16621675. arXiv:cs/0610132
 K. Lee, M. E. O'Sullivan, "Sudan's List Decoding of
ReedSolomon Codes from a Groebner Basis Perspective," Journal of Symbolic Computation 43 (2008), no. 9, 645658. arXiv:cs/0601022
 M. BrasAmoros, M. E. O'Sullivan,
"Redundancies of CorrectionCapabilityOptimized ReedMuller Codes," Discrete Applied Mathematics 156 (2008), no. 15, 30053010. arXiv:cs/0609160
 M. BrasAmoros, M. E. O'Sullivan,
"Duality for Several Families of Evaluation Codes," Advances in the Mathematics of Communications, 2 (2008), no. 1, 1533. arXiv:cs/0609159
 M. BrasAmoros, M. E. O'Sullivan,
"The Order Bound on the Minimum Distance of the OnePoint Codes
Associated to a GarciaStichtenoth Tower of Function Fields,"
IEEE Transactions on Information Theory,
53, (2007), no. 11, 42414245. arXiv:cs/0609161
 M. BrasAmoros, M. E. O'Sullivan, "On Semigroups Generated by Two
Consecutive Integers and Improved Hermitian Codes," IEEE Transactions on Information Theory,
53 (2007), no. 7, 25602566. arXiv:cs/0609162
 E. Byrne, M. Greferath, M. E. O'Sullivan, "The Linear Programming
Bound for Codes over Finite Frobenius Rings," Designs, Codes and Cryptography 42 (2007), no. 3, 289301.
E. Byrne, M. E. O'Sullivan, M. Greferath, "Errata for: `The linear
programming bound for codes over finite Frobenius rings' " Designs, Codes, Cryptography, 45 (2007), no. 2, 269270.
 M. Greferath, G. McGuire, M. E. O'Sullivan, "On Plotkin Optimal Codes
over Finite Frobenius Rings," Journal of Algebra
and Its Applications 5 (2006), no. 6, 799815.
 M. BrasAmoros, M. E. O'Sullivan, "The Correction Capability of the
BerlekampMasseySakata Algorithm with Majority Voting," Applicable Algebra in Engineering, Communications and
Computing 17 (2006), no. 5, 315335.
 M. E. O'Sullivan, "Algebraic Construction of Sparse Matrices with
Large Girth," IEEE Transactions on Information Theory,
vol. 52, pp. 718727, 2006.
 M. Greferath, M. E. O'Sullivan, "On Bounds for Codes over
Frobenius Rings under Homogeneous Weights," Discrete
Mathematics, vol. 289, pp. 1124, 2004.
 M. E. O'Sullivan, "On Koetter's Algorithm and the Computation
of Error Values," Designs, Codes and Cryptography, vol. 31, pp. 169188, 2004. ps.gz file
 M. E. O'Sullivan, "The Key Equation for OnePoint Codes and
Efficient Error Evaluation" Journal of Pure and Applied Algebra, vol. 169, issue 23,
pp. 295320, 2002. ps.gz file
 M. E. O'Sullivan, "New Codes for the BerlekampMasseySakata
Algorithm," Finite Fields and Their Applications, vol. 7, pp. 293317, 2001.
 M. E. O'Sullivan, "Decoding of Hermitian Codes: The Key
Equation and Efficient
Error Evaluation," IEEE Transactions on Information Theory,
vol. 46, no. 2, pp. 512523, 2000.
 M. E. O'Sullivan, "Decoding of Codes Defined by a Single Point
on a Curve," IEEE Transactions on Information Theory, special issue on
algebraic geometry codes, vol. 41, no. 6, pp. 17091719, 1995.
Articles in Refereed Proceedings
 S. Lampoudi, J. Brevik, M. E. O'Sullivan, "Combinatorial Properties
as Predictors for the Performance of the SumProduct Algorithm,"
12th Canadian Workshop on Information Theory, (CWIT) pp.134138,
1720 May 2011.
 F. Hernando, M. E. O'Sullivan, E. Popovici, S. Srivastava,
"SubfieldSubcodes of Generalied Toric Codes," 2010 IEEE International
Symposium on Information Theory (ISIT 2010).
 M. BrasAmoros, M. E. O'Sullivan:
"From the Euclidean Algorithm for Solving a Key Equation for Dual
ReedSolomon Codes to the BerlekampMassey Algorithm," Applied Algebra, Algebraic Algorithms and ErrorCorrecting
Codes, M. BrasAmoros, T. Hoholdt (eds.), Springer, Lecture Notes
in Computer Science, vol. 5527,
pp. 3242, June, 2009.
 J. Brevik, M. E. O'Sullivan, A, Umlauf,
R. Wolski: "Simulation of the SumProduct Algorithm Using
Stratified Sampling," Applied Algebra, Algebraic Algorithms and ErrorCorrecting Codes,
M. BrasAmoros, T. Hoholdt (eds.), Springer, Lecture Notes in Computer
Science, vol. 5527, pp. 6572,
June, 2009.
 D. Monarres, M. E. O'Sullivan: "A Generalization of
the Zigzag Product by Means of the Sandwich Product," Applied Algebra, Algebraic Algorithms and ErrorCorrecting
Codes, M. BrasAmoros, T. H\'oholdt (eds.),
Springer, Lecture Notes in Computer Science, vol. 5527, pp. 231234,
June, 2009.
 M. BrasAmoros, M. E. O'Sullivan,
"Extended NormTrace Codes with Optimized Correction Capability," Applied Algebra, Algebraic Algorithms and ErrorCorrecting Codes,
P. V. Kumar, T. Hoholdt, H. Janwa (eds.), Springer, Lecture Notes in
Computer Science, vol. 4851,
pp. 337346, Dec., 2007.
 M. O'Sullivan, J. Brevik, R. Wolski, "The SumProduct Algorithm on
Small Graphs,"
in Advances in Coding Theory and Cryptology,
T. Shaska, W. C. Huffman, D. Joyner, V. Ustimenko eds.,
Series on Coding Theory and Cryptology, 2. World Scientific, 2007, 160180.
 E. Byrne, M. Greferath, M. E. O'Sullivan, "Duality of RingLinear
Codes and a Linear Programming Bound," International Workshop on
Coding and Cryptography, Versailles, France, 2007.
 R. Agarwal, E. Popovici, B. O'Flynn, M. O'Sullivan,
"A Parallel Architecture for Hermitian Decoders: Satisfying Resource
and Throughput Constraints," IEEE Proc., International Symposium on Circuits and
Systems, ISCAS 2007.
 R. Moberly, M. O'Sullivan and K. Waheed, "LDPC Decoder with a
LimitedPrecision FPGAbased FloatingPoint Multiplication
Coprocessor," Proceedings SPIE Advanced Signal Processing Algorithms,
Architectures,
and Implementations, August 2007.
 R. Moberly, M. O'Sullivan, "Representing Probabilities with Limited
Precision for Iterative SoftDecision LDPC Decoding", Proceedings Wireless and Personal Multimedia Conference,
September 2006.
 R. Moberly, M. O'Sullivan, "Computational Performance of Various
Formulations of the Iterative SoftDecision Decoder Algorithm", Proceedings IEEE International Symposium on Information Theory,
Seattle, WA, July, 2006, pp. 17031707.
 K. Lee, M. E.O'Sullivan
Groebner Bases for SoftDecision Decoding of ReedSolomon Codes 2006 IEEE International Symposium on Information Theory,
Seattle, WA, July, 2006, pp. 20322036.
 M. E. O'Sullivan, J. Brevik, R. Wolski
"The Performance of LDPC codes with Large Girth," Proc. 43rd Allerton
Conference on Communication, Control and Computing, Univ. Illinois,
2005, pp. 17591767.
 A. Byrne, E. Popovici, M. E. O'Sullivan,
"Versatile Architectures for Decoding a Class of LDPC Codes," IEEE European Conference on Circuit Theory and Design 2005, to appear.
 M. Greferath, M. E. O'Sullivan, R. Smarandache,
"Construction of Good LDPC Codes using Dilation Matrices," Proc. IEEE International Symposium on Information
Theory, Chicago, Illinois, p. 237, 2004.
 M. E. O'Sullivan, R. Smarandache, "Highrate, Short Length, (3,
3s)regular LDPC Codes of Girth 6 and 8," Proc. IEEE
International Symposium on Information Theory, Yokohama, Japan,
p. 59, 2003.
 M. E. O'Sullivan, M. Greferath, R. Smarandache,
"Construction of LDPC Codes from Affine Permutation Matrices," Proc. 40th annual Allerton Conference of Communication,
Control and Computing, Univ. Illinois, 2002. ps.gz file
 E. Popovici, P. Fitzpatrick, R. Koetter, M. E. O'Sullivan,
"Implementation of a Hermitian decoder,"
in Proc. IEEE Int. Symp. Information
Theory , Washington D. C., p. 311, July 2001.
 M. E. O'Sullivan, "Alternative Approaches to the Computation of Error Values for
Hermitian Codes," Proceedings of the 37th Allerton
Conference on Communication, Control and Computing,
Univ. Illinois, pp 557566, 2000. ps.gz file
 M. E. O'Sullivan,
"Decoding of Codes on Surfaces," Proc., IEEE
Information Theory Workshop, Killarney, Ireland, pp. 3334, June, 1998.
 M. E. O'Sullivan, "Decoding of OnePoint Codes Using Error Evaluator Polynomials," Proc. IEEE International Symposium on
Information Theory, Ulm, Germany, p. 377, July 1997.
 M. E. O'Sullivan, "Decoding Hermitian Codes Beyond (d1)/2" Proc. IEEE International Symposium on Information
Theory, Ulm, Germany, p. 384, July 1997.
 M. E. O'Sullivan, "VLSI Architecture for a Decoder for Hermitian Codes" Proc. IEEE International Symposium on Information Theory,
Ulm, Germany, p. 376, July 1997.
Short Courses
 Lecturer, Soria Summer School on Computational Mathematics:
Algebraic Coding Theory, Soria, Spain, July 211, 2008.
 Lecturer, 2004 Summer Program for Graduate Students
in Coding and Cryptography, sponsored by the Institute for Mathematics
and Its Applications, University of Notre Dame, June 826, 2004.
 Short course: "Coding Theory: Code Constructions and Algorithms"
Universitat Politecnica de Catalunya, Barcelona, Spain, June 26, 2003.
Unpublished Articles
 M. BrasAmoros, M. E. O'Sullivan, "The BerlekampMassey
Algorithm and the Euclidean Algorithm: a Closer Link."
arXiv:0908.2198
 "A Generalization of the BerlekampMasseySakata Algorithm." ps.gz file
 "Decoding of Hermitian Codes: Beyond the Minimum Distance
Bound," ps.gz file