default search action
Keith E. Mellinger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j22]Keith E. Mellinger, Ryan Vaughn, Oscar Vega:
Graphs embedded into finite projective planes. Contributions Discret. Math. 10(1) (2015) - [j21]Jeremy M. Dover, Keith E. Mellinger
:
Small Kakeya sets in non-prime order planes. Eur. J. Comb. 47: 95-102 (2015) - 2013
- [j20]Felix Lazebnik, Keith E. Mellinger, Oscar Vega:
Embedding Cycles in Finite Planes. Electron. J. Comb. 20(3): 24 (2013) - 2012
- [j19]Noga Alon, Keith E. Mellinger, Dhruv Mubayi, Jacques Verstraëte:
The de Bruijn-Erdős theorem for hypergraphs. Des. Codes Cryptogr. 65(3): 233-245 (2012) - [j18]Jeremy M. Dover, Keith E. Mellinger, Kenneth L. Wantz:
Generalized Pellegrino caps. Finite Fields Their Appl. 18(5): 946-955 (2012) - 2011
- [j17]T. L. Alderson
Spreads, arcs, and multiple wavelength codes. Discret. Math. 311(13): 1187-1196 (2011) - 2010
- [j16]T. L. Alderson
Classes of permutation arrays in finite projective spaces. Int. J. Inf. Coding Theory 1(4): 371-383 (2010)
2000 – 2009
- 2009
- [j15]T. L. Alderson
2-dimensional optical orthogonal codes from singer groups. Discret. Appl. Math. 157(14): 3008-3019 (2009) - 2008
- [j14]T. L. Alderson
Geometric constructions of optimal optical orthogonal codes. Adv. Math. Commun. 2(4): 451-467 (2008) - [j13]T. L. Alderson
Classes of optical orthogonal codes from arcs in root subspaces. Discret. Math. 308(7): 1093-1101 (2008) - [j12]T. L. Alderson
Families of Optimal OOCs With lambda = 2. IEEE Trans. Inf. Theory 54(8): 3722-3724 (2008) - 2007
- [j11]Keith E. Mellinger:
Classes of codes from quadratic surfaces of PG(3, q). Contributions Discret. Math. 2(1) (2007) - [j10]Jon-Lark Kim, Keith E. Mellinger, Leo Storme
Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles. Des. Codes Cryptogr. 42(1): 73-92 (2007) - [j9]Gary L. Ebert, Keith E. Mellinger:
Mixed partitions and related designs. Des. Codes Cryptogr. 44(1-3): 15-23 (2007) - [j8]T. L. Alderson
Constructions of Optical Orthogonal Codes from Finite Geometry. SIAM J. Discret. Math. 21(3): 785-793 (2007) - 2006
- [j7]Sean V. Droms, Keith E. Mellinger, Chris Meyer:
LDPC codes generated by conics in the classical projective plane. Des. Codes Cryptogr. 40(3): 343-356 (2006) - 2005
- [j6]Keith E. Mellinger, Dhruv Mubayi:
Constructions of bipartite graphs from finite geometries. J. Graph Theory 49(1): 1-10 (2005) - 2004
- [j5]Keith E. Mellinger:
LDPC Codes from Triangle-Free Line Sets. Des. Codes Cryptogr. 32(1-3): 341-350 (2004) - [j4]Keith E. Mellinger:
Classical mixed partitions. Discret. Math. 283(1-3): 267-271 (2004) - [j3]Keith E. Mellinger:
Mixed partitions of PG(3, q2). Finite Fields Their Appl. 10(4): 626-635 (2004) - 2003
- [j2]Keith E. Mellinger:
A Geometric Relationship Between Equivalent Spreads. Des. Codes Cryptogr. 30(1): 63-71 (2003) - [j1]Jon-Lark Kim, Keith E. Mellinger, Vera Pless:
Projections of Binary Linear Codes onto Larger Fields. SIAM J. Discret. Math. 16(4): 591-603 (2003)
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-25 05:58 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: