default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael E. O'Sullivan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i15]Michael E. O'Sullivan, Maria Bras-Amorós:
The Key Equation for One-Point Codes. CoRR abs/2108.02758 (2021)
2010 – 2019
- 2019
- [j17]Maria Bras-Amorós
, Michael E. O'Sullivan:
The Symmetric Key Equation for Reed-Solomon Codes and a New Perspective on the Berlekamp-Massey Algorithm. Symmetry 11(11): 1357 (2019) - 2017
- [i14]Yves Aubry, Wouter Castryck, Sudhir R. Ghorpade, Gilles Lachaud, Michael E. O'Sullivan, Samrith Ram:
Hypersurfaces in weighted projective spaces over finite fields with applications to coding theory. CoRR abs/1706.03050 (2017) - 2014
- [j16]Kwankyu Lee, Maria Bras-Amorós, Michael E. O'Sullivan:
Unique Decoding of General AG Codes. IEEE Trans. Inf. Theory 60(4): 2038-2053 (2014) - [i13]John O. Brevik, Michael E. O'Sullivan:
The Sum-Product Algorithm for Degree-2 Check Nodes and Trapping Sets. CoRR abs/1411.2169 (2014) - 2013
- [j15]Fernando Hernando, Michael E. O'Sullivan, Diego Ruano:
List decoding of repeated codes. Appl. Algebra Eng. Commun. Comput. 24(3-4): 237-253 (2013) - [j14]Fernando Hernando, Kyle Marshall, Michael E. O'Sullivan:
The dimension of subcode-subfields of shortened generalized Reed-Solomon codes. Des. Codes Cryptogr. 69(1): 131-142 (2013) - 2012
- [j13]Kwankyu Lee, Maria Bras-Amorós, Michael E. O'Sullivan:
Unique Decoding of Plane AG Codes via Interpolation. IEEE Trans. Inf. Theory 58(6): 3941-3950 (2012) - [i12]Fernando Hernando, Michael E. O'Sullivan, Diego Ruano:
List decoding of repeated codes. CoRR abs/1202.1238 (2012) - [i11]Kwankyu Lee, Maria Bras-Amorós, Michael E. O'Sullivan:
Unique Decoding of General AG Codes. CoRR abs/1210.3101 (2012) - 2011
- [i10]Fernando Hernando, Kyle Marshall, Michael E. O'Sullivan:
The Dimension of Subcode-Subfields of Shortened Generalized Reed Solomon Codes. CoRR abs/1108.5475 (2011) - [i9]Kwankyu Lee, Maria Bras-Amorós, Michael E. O'Sullivan:
Unique Decoding of Plane AG Codes via Interpolation. CoRR abs/1110.6251 (2011) - 2010
- [j12]Kwankyu Lee, Michael E. O'Sullivan:
Algebraic soft-decision decoding of Hermitian codes. IEEE Trans. Inf. Theory 56(6): 2587-2600 (2010) - [c9]Fernando Hernando, Michael E. O'Sullivan, Emanuel M. Popovici, Shraddha Srivastava:
Subfield-subcodes of Generalized Toric codes. ISIT 2010: 1125-1129 - [i8]Fernando Hernando, Michael E. O'Sullivan, Emanuel M. Popovici, Shraddha Srivastava:
Subfield-Subcodes of Generalized Toric codes. CoRR abs/1005.1871 (2010)
2000 – 2009
- 2009
- [j11]Kwankyu Lee, Michael E. O'Sullivan:
List decoding of Hermitian codes using Gröbner bases. J. Symb. Comput. 44(12): 1662-1675 (2009) - [c8]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 - [c7]John Brevik, Michael E. O'Sullivan, Anya Umlauf, Richard Wolski:
Simulation of the Sum-Product Algorithm Using Stratified Sampling. AAECC 2009: 65-72 - [c6]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 - [i7]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
- [j10]Maria Bras-Amorós, Michael E. O'Sullivan:
Duality for some families of correction capability optimized evaluation codes. Adv. Math. Commun. 2(1): 15-33 (2008) - [j9]Maria Bras-Amorós, Michael E. O'Sullivan:
Redundancies of correction capability optimized Reed-Muller codes. Discret. Appl. Math. 156(15): 3005-3010 (2008) - [j8]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) - [i6]Kwankyu Lee, Michael E. O'Sullivan:
Algebraic Soft-Decision Decoding of Hermitian Codes. CoRR abs/0807.4995 (2008) - 2007
- [j7]Eimear Byrne, Marcus Greferath, Michael E. O'Sullivan:
The linear programming bound for codes over finite Frobenius rings. Des. Codes Cryptogr. 42(3): 289-301 (2007) - [j6]Eimear Byrne, Marcus Greferath, Michael E. O'Sullivan:
Errata for "The linear programming bound for codes over finite Frobenius rings". Des. Codes Cryptogr. 45(2): 269-270 (2007) - [j5]Maria Bras-Amorós, Michael E. O'Sullivan:
On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes. IEEE Trans. Inf. Theory 53(7): 2560-2566 (2007) - [j4]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 Trans. Inf. Theory 53(11): 4241-4245 (2007) - [c5]Maria Bras-Amorós, Michael E. O'Sullivan:
Extended Norm-Trace Codes with Optimized Correction Capability. AAECC 2007: 337-346 - [c4]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 - 2006
- [c3]Kwankyu Lee, Michael E. O'Sullivan:
An Interpolation Algorithm using Gröbner Bases for Soft-Decision Decoding of Reed-Solomon Codes. ISIT 2006: 2032-2036 - [i5]Maria Bras-Amorós, Michael E. O'Sullivan:
Duality for Several Families of Evaluation Codes. CoRR abs/cs/0609159 (2006) - [i4]Maria Bras-Amorós, Michael E. O'Sullivan:
Redundancies of Correction-Capability-Optimized Reed-Muller Codes. CoRR abs/cs/0609160 (2006) - [i3]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) - [i2]Maria Bras-Amorós, Michael E. O'Sullivan:
On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes. CoRR abs/cs/0609162 (2006) - [i1]Kwankyu Lee, Michael E. O'Sullivan:
List Decoding of Hermitian Codes using Groebner Bases. CoRR abs/cs/0610132 (2006) - 2005
- [c2]Andrew Byrne, Emanuel M. Popovici, Michael E. O'Sullivan:
Versatile architectures for decoding a class of LDPC codes. ECCTD 2005: 269-272 - 2004
- [j3]Michael E. O'Sullivan:
On Koetter's Algorithm and the Computation of Error Values. Des. Codes Cryptogr. 31(2): 169-188 (2004) - [j2]Marcus Greferath, Michael E. O'Sullivan:
On bounds for codes over Frobenius rings under homogeneous weights. Discret. Math. 289(1-3): 11-24 (2004) - [c1]Marcus Greferath, Michael E. O'Sullivan, Roxana Smarandache:
Construction of good LDPC codes using dilation matrices. ISIT 2004: 237 - 2000
- [j1]Michael E. O'Sullivan:
Decoding of Hermitian codes: The key equation and efficient error evaluation. IEEE Trans. Inf. Theory 46(2): 512-523 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
