15 citations · 60 across the 17 of their papers we have counts for
17 papers
The Key Equation for One-Point Codes
Michael E. O'Sullivan, Maria Bras-Amorós
For Reed-Solomon codes, the key equation relates the syndrome polynomial---computed from the parity check matrix and the received vector---to two unknown polynomials, the locator a…
Hypersurfaces in weighted projective spaces over finite fields with applications to coding theory
Yves Aubry, Wouter Castryck, Sudhir R. Ghorpade +3
We consider the question of determining the maximum number of -rational points that can lie on a hypersurface of a given degree in a weighted projective space over th…
The Hamiltonian problem and -path traceable graphs
Kashif Bari, Michael E. O'Sullivan
The problem of characterizing maximal non-Hamiltonian graphs may be naturally extended to characterizing graphs that are maximal with respect to non-traceability and beyond that to…
The Sum-Product Algorithm for Degree-2 Check Nodes and Trapping Sets
John O. Brevik, Michael E. O'Sullivan
The sum-product algorithm for decoding of binary codes is analyzed for bipartite graphs in which the check nodes all have degree . The algorithm simplifies dramatically and may…
Unique Decoding of General AG Codes
Kwankyu Lee, Maria Bras-Amorós, Michael E. O'Sullivan
A unique decoding algorithm for general AG codes, namely multipoint evaluation codes on algebraic curves, is presented. It is a natural generalization of the previous decoding algo…
List decoding of repeated codes
Fernando Hernando, Michael O'Sullivan, Diego Ruano
Assuming that we have a soft-decision list decoding algorithm of a linear code, a new hard-decision list decoding algorithm of its repeated code is proposed in this article. Althou…