Michael E. O'Sullivan

Orcid: 0000-0002-2735-2407

According to our database1, Michael E. O'Sullivan authored at least 33 papers between 2000 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
The Key Equation for One-Point Codes.
CoRR, 2021

2019
The Symmetric Key Equation for Reed-Solomon Codes and a New Perspective on the Berlekamp-Massey Algorithm.
Symmetry, 2019

2017
Hypersurfaces in weighted projective spaces over finite fields with applications to coding theory.
CoRR, 2017

2014
Unique Decoding of General AG Codes.
IEEE Trans. Inf. Theory, 2014

The Sum-Product Algorithm for Degree-2 Check Nodes and Trapping Sets.
CoRR, 2014

2013
The dimension of subcode-subfields of shortened generalized Reed-Solomon codes.
Des. Codes Cryptogr., 2013

List decoding of repeated codes.
Appl. Algebra Eng. Commun. Comput., 2013

2012
Unique Decoding of Plane AG Codes via Interpolation.
IEEE Trans. Inf. Theory, 2012

2010
Algebraic soft-decision decoding of Hermitian codes.
IEEE Trans. Inf. Theory, 2010

Subfield-subcodes of Generalized Toric codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
List decoding of Hermitian codes using Gröbner bases.
J. Symb. Comput., 2009

The Berlekamp-Massey Algorithm and the Euclidean Algorithm: a Closer Link
CoRR, 2009

A Generalization of the Zig-Zag Graph Product by Means of the Sandwich Product.
Proceedings of the Applied Algebra, 2009

Simulation of the Sum-Product Algorithm Using Stratified Sampling.
Proceedings of the Applied Algebra, 2009

From the Euclidean Algorithm for Solving a Key Equation for Dual Reed-Solomon Codes to the Berlekamp-Massey Algorithm.
Proceedings of the Applied Algebra, 2009

2008
List decoding of Reed-Solomon codes from a Gröbner basis perspective.
J. Symb. Comput., 2008

Redundancies of correction capability optimized Reed-Muller codes.
Discret. Appl. Math., 2008

Duality for some families of correction capability optimized evaluation codes.
Adv. Math. Commun., 2008

2007
The Order Bound on the Minimum Distance of the One-Point Codes Associated to the Garcia-Stichtenoth Tower.
IEEE Trans. Inf. Theory, 2007

On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes.
IEEE Trans. Inf. Theory, 2007

Errata for "The linear programming bound for codes over finite Frobenius rings".
Des. Codes Cryptogr., 2007

The linear programming bound for codes over finite Frobenius rings.
Des. Codes Cryptogr., 2007

A Parallel Architecture for Hermitian Decoders: Satisfying Resource and Throughput Constraints.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2007), 2007

Extended Norm-Trace Codes with Optimized Correction Capability.
Proceedings of the Applied Algebra, 2007

2006
List Decoding of Hermitian Codes using Groebner Bases
CoRR, 2006

The Order Bound on the Minimum Distance of the One-Point Codes Associated to a Garcia-Stichtenoth Tower of Function Fields
CoRR, 2006

Duality for Several Families of Evaluation Codes
CoRR, 2006

An Interpolation Algorithm using Gröbner Bases for Soft-Decision Decoding of Reed-Solomon Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Versatile architectures for decoding a class of LDPC codes.
Proceedings of the 2005 European Conference on Circuit Theory and Design, 2005

2004
On bounds for codes over Frobenius rings under homogeneous weights.
Discret. Math., 2004

On Koetter's Algorithm and the Computation of Error Values.
Des. Codes Cryptogr., 2004

Construction of good LDPC codes using dilation matrices.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2000
Decoding of Hermitian codes: The key equation and efficient error evaluation.
IEEE Trans. Inf. Theory, 2000


  Loading...