 | 2009 |
|---|
| 21 |       | David M. Monarres,
Michael E. O'Sullivan:
A Generalization of the Zig-Zag Graph Product by Means of the Sandwich Product.
AAECC 2009: 231-234 |
| 20 | | Maria Bras-Amorós,
Michael E. O'Sullivan:
From the Euclidean Algorithm for Solving a Key Equation for Dual Reed-Solomon Codes to the Berlekamp-Massey Algorithm.
AAECC 2009: 32-42 |
| 19 | | John Brevik,
Michael E. O'Sullivan,
Anya Umlauf,
Richard Wolski:
Simulation of the Sum-Product Algorithm Using Stratified Sampling.
AAECC 2009: 65-72 |
| 18 | | Maria Bras-Amorós,
Michael E. O'Sullivan:
The Berlekamp-Massey Algorithm and the Euclidean Algorithm: a Closer Link
CoRR abs/0908.2198: (2009) |
| 2008 |
|---|
| 17 | | Kwankyu Lee,
Michael E. O'Sullivan:
Algebraic Soft-Decision Decoding of Hermitian Codes
CoRR abs/0807.4995: (2008) |
| 16 | | Maria Bras-Amorós,
Michael E. O'Sullivan:
Redundancies of correction capability optimized Reed-Muller codes.
Discrete Applied Mathematics 156(15): 3005-3010 (2008) |
| 15 | | Kwankyu Lee,
Michael E. O'Sullivan:
List decoding of Reed-Solomon codes from a Gröbner basis perspective.
J. Symb. Comput. 43(9): 645-658 (2008) |
| 2007 |
|---|
| 14 | | Maria Bras-Amorós,
Michael E. O'Sullivan:
Extended Norm-Trace Codes with Optimized Correction Capability.
AAECC 2007: 337-346 |
| 13 | | Rachit Agarwal,
Emanuel M. Popovici,
Brendan O'Flynn,
Michael E. O'Sullivan:
A Parallel Architecture for Hermitian Decoders: Satisfying Resource and Throughput Constraints.
ISCAS 2007: 1405-1408 |
| 12 | | Eimear Byrne,
Marcus Greferath,
Michael E. O'Sullivan:
The linear programming bound for codes over finite Frobenius rings.
Des. Codes Cryptography 42(3): 289-301 (2007) |
| 11 | | Eimear Byrne,
Marcus Greferath,
Michael E. O'Sullivan:
Errata for "The linear programming bound for codes over finite Frobenius rings".
Des. Codes Cryptography 45(2): 269-270 (2007) |
| 10 | | Maria Bras-Amorós,
Michael E. O'Sullivan:
The Order Bound on the Minimum Distance of the One-Point Codes Associated to the Garcia-Stichtenoth Tower.
IEEE Transactions on Information Theory 53(11): 4241-4245 (2007) |
| 9 | | Maria Bras-Amorós,
Michael E. O'Sullivan:
On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes.
IEEE Transactions on Information Theory 53(7): 2560-2566 (2007) |
| 2006 |
|---|
| 8 | | Maria Bras-Amorós,
Michael E. O'Sullivan:
Duality for Several Families of Evaluation Codes
CoRR abs/cs/0609159: (2006) |
| 7 | | Maria Bras-Amorós,
Michael E. O'Sullivan:
Redundancies of Correction-Capability-Optimized Reed-Muller Codes
CoRR abs/cs/0609160: (2006) |
| 6 | | Maria Bras-Amorós,
Michael E. O'Sullivan:
The Order Bound on the Minimum Distance of the One-Point Codes Associated to a Garcia-Stichtenoth Tower of Function Fields
CoRR abs/cs/0609161: (2006) |
| 5 | | Maria Bras-Amorós,
Michael E. O'Sullivan:
On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes
CoRR abs/cs/0609162: (2006) |
| 4 | | Kwankyu Lee,
Michael E. O'Sullivan:
List Decoding of Hermitian Codes using Groebner Bases
CoRR abs/cs/0610132: (2006) |
| 2004 |
|---|
| 3 | | Michael E. O'Sullivan:
On Koetter's Algorithm and the Computation of Error Values.
Des. Codes Cryptography 31(2): 169-188 (2004) |
| 2 | | Marcus Greferath,
Michael E. O'Sullivan:
On bounds for codes over Frobenius rings under homogeneous weights.
Discrete Mathematics 289(1-3): 11-24 (2004) |
| 2000 |
|---|
| 1 |  | Michael E. O'Sullivan:
Decoding of Hermitian codes: The key equation and efficient error evaluation.
IEEE Transactions on Information Theory 46(2): 512-523 (2000) |
