Michael E. O'Sullivan

From MaRDI portal
Revision as of 02:40, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Michael E. O'Sullivan to Michael E. O'Sullivan: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:198995

Available identifiers

zbMath Open osullivan.michael-eMaRDI QIDQ198995

List of research outcomes





PublicationDate of PublicationType
Hypersurfaces in weighted projective spaces over finite fields with applications to coding theory2018-04-11Paper
Algebraic Soft-Decision Decoding of Hermitian Codes2017-07-27Paper
Unique Decoding of Plane AG Codes via Interpolation2017-07-12Paper
The Hamiltonian problem and \(t\)-path traceable graphs2017-06-14Paper
Unique Decoding of General AG Codes2017-05-16Paper
List decoding of repeated codes2013-09-30Paper
The dimension of subcode-subfields of shortened generalized Reed-Solomon codes2013-07-26Paper
From the Euclidean Algorithm for Solving a Key Equation for Dual Reed–Solomon Codes to the Berlekamp–Massey Algorithm2010-01-14Paper
Simulation of the Sum-Product Algorithm Using Stratified Sampling2010-01-14Paper
A Generalization of the Zig-Zag Graph Product by Means of the Sandwich Product2010-01-14Paper
List decoding of Hermitian codes using Gröbner bases2009-10-16Paper
The Key Equation for One-Point Codes2009-03-16Paper
Redundancies of correction capability optimized Reed-Muller codes2009-03-09Paper
Algebraic construction of sparse matrices with large girth2008-12-21Paper
The Order Bound on the Minimum Distance of the One-Point Codes Associated to the Garcia–Stichtenoth Tower2008-12-21Paper
On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes2008-12-21Paper
Duality for some families of correction capability optimized evaluation codes2008-08-22Paper
List decoding of Reed-Solomon codes from a Gröbner basis perspective2008-06-25Paper
Extended Norm-Trace Codes with Optimized Correction Capability2008-04-17Paper
https://portal.mardi4nfdi.de/entity/Q54482132008-03-20Paper
The linear programming bound for codes over finite Frobenius rings2007-09-20Paper
ON PLOTKIN-OPTIMAL CODES OVER FINITE FROBENIUS RINGS2007-02-07Paper
The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting2007-01-24Paper
On bounds for codes over Frobenius rings under homogeneous weights2005-02-22Paper
On Koetter's algorithm and the computation of error values2004-06-11Paper
The key equation for one-point codes and efficient error evaluation2002-06-24Paper
New codes for the Berlekamp-Massey-Sakata algorithm2001-08-20Paper
Decoding of Hermitian codes: the key equation and efficient error evaluation2000-09-07Paper
Decoding of codes defined by a single point on a curve1996-08-13Paper

Research outcomes over time

This page was built for person: Michael E. O'Sullivan