Demo Data from EDBT 2026 / reviewers in the wild / expert
Keith E. Mellinger
dblp:07/7031
· DBLP profile ↗
10ranked-venue papers
2as first author
0since 2021 · last 2012
0000-0001-7995-0065ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 6 · 2 first-authorTheory of computation · 4
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 1 heaviest of 1, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › sequences › sequence design
optical orthogonal codes |
0.1 | 1 | 2008 | Families of Optimal OOCs With lambda = 2 · IEEE Trans. Inf. Theory 2008 |
Methods — techniques the papers use, named apart from their topics
singer groups · 0.1hyperovals · 0.1finite projective spaces · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | The de Bruijn-Erdős theorem for hypergraphs
Noga Alon, Keith E. Mellinger, Dhruv Mubayi, Jacques Verstraëte |
Des. Codes Cryptogr. | 2 |
| 2009 | 2-dimensional optical orthogonal codes from singer groups
Tim L. Alderson, Keith E. Mellinger |
Discret. Appl. Math. | 2 |
| 2008 | Families of Optimal OOCs With lambda = 2abstractWe provide a new construction yielding one new and one known infinite family of optimal (n,w,2) -optical orthogonal codes,wisin {4,6}. Our construction relies on various techniques in finite projective spaces involving hyperovals in projective planes and Singer groups. Tim L. Alderson, Keith E. Mellinger |
IEEE Trans. Inf. Theory | 2 |
| 2007 | Mixed partitions and related designs
Gary L. Ebert, Keith E. Mellinger |
Des. Codes Cryptogr. | 2 |
| 2007 | Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
Jon-Lark Kim, Keith E. Mellinger, Leo Storme |
Des. Codes Cryptogr. | 2 |
| 2007 | Constructions of Optical Orthogonal Codes from Finite GeometryabstractThe link between finite geometry and various classes of error-correcting codes is well known. Arcs in projective spaces, for instance, have a close tie to linear MDS codes as well as the high-performing low-density parity-check codes. In this article, we demonstrate a connection between arcs and optical orthogonal codes (OOCs), a class of nonlinear binary codes used for many modern communication applications. Using arcs and Baer subspaces of finite projective spaces, we construct some infinite classes of OOCs with auto-correlation and cross-correlation both larger than 1. Tim L. Alderson, Keith E. Mellinger |
SIAM J. Discret. Math. | 2 |
| 2006 | LDPC codes generated by conics in the classical projective plane
Sean V. Droms, Keith E. Mellinger, Chris Meyer |
Des. Codes Cryptogr. | 2 |
| 2004 | LDPC Codes from Triangle-Free Line Sets
Keith E. Mellinger |
Des. Codes Cryptogr. | 1 |
| 2003 | A Geometric Relationship Between Equivalent Spreads
Keith E. Mellinger |
Des. Codes Cryptogr. | 1 |
| 2003 | Projections of Binary Linear Codes onto Larger FieldsabstractWe study certain projections of binary linear codes onto larger fields. These projections include the well-known projection of the extended Golay [24,12,8] code onto the hexacode over $\mbox{GF}(4)$ and the projection of the Reed--Muller code R(2,5) onto the unique self-dual [8,4,4] code over $\mbox{GF}(4)$. We give acharacterization of these projections, and we construct several binary linear codes which have best known optimal parameters, for instance, [20,11,5], [40,22,8], [48,21,12], and [72,31,16]. We also relate the automorphism group of a quaternary code to that of the corresponding binary code. Jon-Lark Kim, Keith E. Mellinger, Vera Pless |
SIAM J. Discret. Math. | 2 |