default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJennifer D. Key
Person information
- affiliation: Clemson University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1992
[b1]Edward F. Assmus Jr., Jennifer D. Key:
Designs and their codes. Cambridge tracts in mathematics 103, Cambridge University Press 1992, ISBN 978-0-521-41361-9, pp. I-IX, 1-392
Journal Articles
- 2023
- [j57]Jennifer D. Key, Bernardo Gabriel Rodrigues:
Minimal PD-sets for codes associated with the graphs Qm2, m even. Appl. Algebra Eng. Commun. Comput. 34(1): 57-66 (2023) - [j56]Washiela Fish, Jennifer D. Key, Eric C. Mwambene:
Special LCD codes from products of graphs. Appl. Algebra Eng. Commun. Comput. 34(4): 553-579 (2023) - 2021
- [j55]Jennifer D. Key, Bernardo Gabriel Rodrigues:
Binary codes from m-ary n-cubes Qmn. Adv. Math. Commun. 15(3): 507-524 (2021) - 2019
- [j54]Jennifer D. Key
, Bernardo Gabriel Rodrigues:
Special LCD Codes from Peisert and Generalized Peisert Graphs. Graphs Comb. 35(3): 633-652 (2019) - [j53]Washiela Fish, Jennifer D. Key, Eric C. Mwambene, Bernardo Gabriel Rodrigues:
Hamming graphs and special LCD codes. J. Appl. Math. Comput. 61(1-2): 461-479 (2019) - 2018
- [j52]Jennifer D. Key, Bernardo Gabriel Rodrigues:
LCD codes from adjacency matrices of graphs. Appl. Algebra Eng. Commun. Comput. 29(3): 227-244 (2018) - [j51]Washiela Fish, Jennifer D. Key, Eric C. Mwambene:
Codes from Adjacency Matrices of Uniform Subset Graphs. Graphs Comb. 34(1): 163-192 (2018) - 2017
- [j50]Jennifer D. Key, T. P. McDonough, Vassili C. Mavron:
Codes from Hall planes of odd order. Adv. Math. Commun. 11(1): 179-185 (2017) - [j49]Jennifer D. Key, T. P. McDonough, Vassili C. Mavron:
Improved partial permutation decoding for Reed-Muller codes. Discret. Math. 340(4): 722-728 (2017) - 2016
- [j48]Jennifer D. Key, Padmapani Seneviratne:
Partial permutation decoding for MacDonald codes. Appl. Algebra Eng. Commun. Comput. 27(5): 399-412 (2016) - [j47]Dieter Jungnickel, Jennifer D. Key, Chris J. Mitchell, Ronald C. Mullin, Peter R. Wild:
Editorial for the 25th anniversary issue. Des. Codes Cryptogr. 78(1): 1-3 (2016) - 2015
- [j46]Washiela Fish, Jennifer D. Key, Eric C. Mwambene:
Binary codes from reflexive uniform subset graphs on 3-sets. Adv. Math. Commun. 9(2): 211-232 (2015) - 2014
- [j45]Washiela Fish, Jennifer D. Key, Eric C. Mwambene:
Ternary codes from some reflexive uniform subset graphs. Appl. Algebra Eng. Commun. Comput. 25(5): 363-382 (2014) - [j44]Dina Ghinelli, Jennifer D. Key, T. P. McDonough:
Hulls of codes from incidence matrices of connected regular graphs. Des. Codes Cryptogr. 70(1-2): 35-54 (2014) - [j43]Washiela Fish, Jennifer D. Key, Eric C. Mwambene:
Codes associated with the odd graphs. Discret. Math. 315-316: 102-111 (2014) - 2013
- [j42]Peter Dankelmann, Jennifer D. Key, Bernardo Gabriel Rodrigues:
A Characterization of Graphs by Codes from their Incidence Matrices. Electron. J. Comb. 20(3): 18 (2013) - [j41]Peter Dankelmann, Jennifer D. Key, Bernardo Gabriel Rodrigues:
Codes from incidence matrices of graphs. Des. Codes Cryptogr. 68(1-3): 373-393 (2013) - 2012
- [j40]Washiela Fish, Jennifer D. Key, Eric C. Mwambene:
Partial permutation decoding for simplex codes. Adv. Math. Commun. 6(4): 505-516 (2012) - 2011
- [j39]Dina Ghinelli, Jennifer D. Key:
Codes from incidence matrices and line graphs of Paley graphs. Adv. Math. Commun. 5(1): 93-108 (2011) - [j38]Jennifer D. Key, Washiela Fish, Eric C. Mwambene:
Codes from the incidence matrices and line graphs of Hamming graphs Hk(n, 2) for k ≥ 2. Adv. Math. Commun. 5(2): 373-394 (2011) - [j37]Washiela Fish, Jennifer D. Key, Eric C. Mwambene:
Codes from the incidence matrices of graphs on 3-sets. Discret. Math. 311(16): 1823-1840 (2011) - 2010
- [j36]Jennifer D. Key, Bernardo Gabriel Rodrigues:
Codes from lattice and related graphs, and permutation decoding. Discret. Appl. Math. 158(16): 1807-1815 (2010) - [j35]Washiela Fish, Jennifer D. Key, Eric C. Mwambene:
Codes from incidence matrices and line graphs of Hamming graphs. Discret. Math. 310(13-14): 1884-1897 (2010) - [j34]Jennifer D. Key, T. P. McDonough, Vassili C. Mavron:
Reed-Muller codes and permutation decoding. Discret. Math. 310(22): 3114-3119 (2010) - [j33]Jennifer D. Key, Jamshid Moori, Bernardo Gabriel Rodrigues:
Codes associated with triangular graphs and permutation decoding. Int. J. Inf. Coding Theory 1(3): 334-349 (2010) - [j32]Washiela Fish, Jennifer D. Key, Eric C. Mwambene:
Binary codes from the line graph of the n-cube. J. Symb. Comput. 45(7): 800-812 (2010) - 2009
- [j31]Jennifer D. Key, Jamshid Moori, B. D. Rodrigues:
Partial permutation decoding of some binary codes from graphs on triples. Ars Comb. 91 (2009) - [j30]Washiela Fish, Jennifer D. Key, Eric C. Mwambene:
Graphs, designs and codes related to the n-cube. Discret. Math. 309(10): 3255-3269 (2009) - [j29]Jennifer D. Key, Jamshid Moori, Bernardo Gabriel Rodrigues:
Ternary codes from graphs on triples. Discret. Math. 309(14): 4663-4681 (2009) - [j28]Jennifer D. Key, T. P. McDonough, Vassili C. Mavron:
An upper bound for the minimum weight of the dual codes of desarguesian planes. Eur. J. Comb. 30(1): 220-229 (2009) - 2008
- [j27]Jennifer D. Key, P. Seneviratne:
Permutation decoding for binary codes from lattice graphs. Discret. Math. 308(13): 2862-2867 (2008) - 2007
- [j26]Jennifer D. Key, Fidele F. Ngwane:
A lower bound for the minimum weight of the dual 7-ary code of a projective plane of order 49. Des. Codes Cryptogr. 44(1-3): 133-142 (2007) - [j25]Jennifer D. Key, P. Seneviratne:
Codes from the line graphs of complete multipartite graphs and PD-sets. Discret. Math. 307(17-18): 2217-2225 (2007) - [j24]Jennifer D. Key, P. Seneviratne:
Binary codes from rectangular lattice graphs and permutation decoding. Eur. J. Comb. 28(1): 121-126 (2007) - 2006
- [j23]Jennifer D. Key, Jamshid Moori, Bernardo Gabriel Rodrigues:
Binary codes from graphs on triples and permutation decoding. Ars Comb. 79 (2006) - [j22]Jennifer D. Key, T. P. McDonough, Vassili C. Mavron:
Information sets and partial permutation decoding for codes from finite geometries. Finite Fields Their Appl. 12(2): 232-247 (2006) - 2005
- [j21]Jennifer D. Key, T. P. McDonough, Vassili C. Mavron:
Partial permutation decoding for codes from finite planes. Eur. J. Comb. 26(5): 665-682 (2005) - 2004
- [j20]Jennifer D. Key, Jamshid Moori, Bernardo Gabriel Rodrigues:
Binary codes from graphs on triples. Discret. Math. 282(1-3): 171-182 (2004) - [j19]Jennifer D. Key, Jamshid Moori, Bernardo Gabriel Rodrigues:
Permutation decoding for the binary codes from triangular graphs. Eur. J. Comb. 25(1): 113-123 (2004) - 2002
- [j18]Peng Ding, Jennifer D. Key:
Subcodes of the Projective Generalized Reed-Muller Codes Spanned by Minimum-Weight Vectors. Des. Codes Cryptogr. 26(1-3): 197-211 (2002) - [j17]K. L. Clark, Jennifer D. Key, Marialuisa J. de Resmini:
Dual Codes of Translation Planes. Eur. J. Comb. 23(5): 529-538 (2002) - 2001
- [j16]Jennifer D. Key:
Some Applications of Magma in Designs and Codes: Oval Designs, Hermitian Unitals and Generalized Reed-Muller Codes. J. Symb. Comput. 31(1/2): 37-53 (2001) - 2000
- [j15]Peng Ding, Jennifer D. Key:
Minimum-weight codewords as generators of generalized Reed-Muller codes. IEEE Trans. Inf. Theory 46(6): 2152-2158 (2000) - 1999
- [j14]Jennifer D. Key, F. E. Sullivan:
Steiner Systems From Binary Codes. Ars Comb. 52 (1999) - [j13]Jennifer D. Key, H. F. Mattson Jr.:
Edward F. Assmus, Jr. (1931-1998). Des. Codes Cryptogr. 17(1-3): 7-11 (1999) - [j12]Neil J. Calkin, Jennifer D. Key, Marialuisa J. de Resmini:
Minimum Weight and Dimension Formulas for Some Geometric Codes. Des. Codes Cryptogr. 17(1-3): 105-120 (1999) - 1996
- [j11]E. F. Assmus Jr., Jennifer D. Key:
Designs and Codes: An update. Des. Codes Cryptogr. 9(1): 7-27 (1996) - 1994
- [j10]Jennifer D. Key, Marialuisa J. de Resmini:
Codewords for Projective Planes from Sets of Type (s, t). Eur. J. Comb. 15(3): 259-268 (1994) - 1993
- [j9]Jennifer D. Key, F. E. Sullivan:
Codes of Steiner Triple and Quadruple Systems. Des. Codes Cryptogr. 3(2): 117-125 (1993) - [j8]Jennifer D. Key:
On a Class of 1-Designs. Eur. J. Comb. 14(1): 37-41 (1993) - 1991
- [j7]Jennifer D. Key:
Hermitian Varieties as Codewords. Des. Codes Cryptogr. 1(3): 255-259 (1991) - [j6]Jennifer D. Key, Kirsten Mackenzie:
An upper bound for the p-rank of a translation plane. J. Comb. Theory A 56(2): 297-302 (1991) - 1990
- [j5]E. F. Assmus Jr., Jennifer D. Key:
Affine and projective planes. Discret. Math. 83(2-3): 161-187 (1990) - 1989
- [j4]Edward F. Assmus Jr., Jennifer D. Key:
Arcs and Ovals in the Hermitian and Ree Unitals. Eur. J. Comb. 10(4): 297-308 (1989) - 1988
- [j3]Jennifer D. Key, N. K. A. Rostom:
Unitary designs with regular sets of points. Discret. Math. 69(3): 235-239 (1988) - 1986
- [j2]E. F. Assmus Jr., Jennifer D. Key:
On an infinite class of steiner systems with t = 3 and k = 6. J. Comb. Theory A 42(1): 55-60 (1986) - 1984
- [j1]Jennifer D. Key, Ernest E. Shult:
Steiner Triple Systems with Doubly Transitive Automorphism Groups: A Corollary to the Classification Theorem for Finite Simple Groups. J. Comb. Theory A 36(1): 105-110 (1984)
Parts in Books or Collections
- 2011
- [p1]Jennifer D. Key:
Permutation decoding for codes from designs, finite geometries and graphs. Information Security, Coding Theory and Related Combinatorics 2011: 172-201
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 2025-01-21 00:14 CET 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:
