Jennifer D. Key

According to our database1, Jennifer D. Key authored at least 52 papers between 1986 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Special LCD Codes from Peisert and Generalized Peisert Graphs.
Graphs Comb., 2019

2018
Codes from Adjacency Matrices of Uniform Subset Graphs.
Graphs Comb., 2018

LCD codes from adjacency matrices of graphs.
Appl. Algebra Eng. Commun. Comput., 2018

2017
Improved partial permutation decoding for Reed-Muller codes.
Discret. Math., 2017

Codes from Hall planes of odd order.
Adv. Math. Commun., 2017

2016
Editorial for the 25th anniversary issue.
Des. Codes Cryptogr., 2016

Partial permutation decoding for MacDonald codes.
Appl. Algebra Eng. Commun. Comput., 2016

2015
Binary codes from reflexive uniform subset graphs on 3-sets.
Adv. Math. Commun., 2015

2014
Codes associated with the odd graphs.
Discret. Math., 2014

Hulls of codes from incidence matrices of connected regular graphs.
Des. Codes Cryptogr., 2014

Ternary codes from some reflexive uniform subset graphs.
Appl. Algebra Eng. Commun. Comput., 2014

2013
Codes from incidence matrices of graphs.
Des. Codes Cryptogr., 2013

A Characterization of Graphs by Codes from their Incidence Matrices.
Electron. J. Comb., 2013

2012
Partial permutation decoding for simplex codes.
Adv. Math. Commun., 2012

2011
Codes from the incidence matrices of graphs on 3-sets.
Discret. Math., 2011

Codes from the incidence matrices and line graphs of Hamming graphs H<sup>k</sup>(n, 2) for k ≥ 2.
Adv. Math. Commun., 2011

Codes from incidence matrices and line graphs of Paley graphs.
Adv. Math. Commun., 2011

2010
Binary codes from the line graph of the n-cube.
J. Symb. Comput., 2010

Codes associated with triangular graphs and permutation decoding.
Int. J. Inf. Coding Theory, 2010

Reed-Muller codes and permutation decoding.
Discret. Math., 2010

Codes from incidence matrices and line graphs of Hamming graphs.
Discret. Math., 2010

Codes from lattice and related graphs, and permutation decoding.
Discret. Appl. Math., 2010

2009
An upper bound for the minimum weight of the dual codes of desarguesian planes.
Eur. J. Comb., 2009

Ternary codes from graphs on triples.
Discret. Math., 2009

Graphs, designs and codes related to the n-cube.
Discret. Math., 2009

Partial permutation decoding of some binary codes from graphs on triples.
Ars Comb., 2009

2008
Permutation decoding for binary codes from lattice graphs.
Discret. Math., 2008

2007
Binary codes from rectangular lattice graphs and permutation decoding.
Eur. J. Comb., 2007

Codes from the line graphs of complete multipartite graphs and PD-sets.
Discret. Math., 2007

A lower bound for the minimum weight of the dual 7-ary code of a projective plane of order 49.
Des. Codes Cryptogr., 2007

2006
Information sets and partial permutation decoding for codes from finite geometries.
Finite Fields Their Appl., 2006

Binary codes from graphs on triples and permutation decoding.
Ars Comb., 2006

2005
Partial permutation decoding for codes from finite planes.
Eur. J. Comb., 2005

2004
Permutation decoding for the binary codes from triangular graphs.
Eur. J. Comb., 2004

Binary codes from graphs on triples.
Discret. Math., 2004

2002
Dual Codes of Translation Planes.
Eur. J. Comb., 2002

Subcodes of the Projective Generalized Reed-Muller Codes Spanned by Minimum-Weight Vectors.
Des. Codes Cryptogr., 2002

2001
Some Applications of Magma in Designs and Codes: Oval Designs, Hermitian Unitals and Generalized Reed-Muller Codes.
J. Symb. Comput., 2001

2000
Minimum-weight codewords as generators of generalized Reed-Muller codes.
IEEE Trans. Inf. Theory, 2000

1999
Edward F. Assmus, Jr. (1931-1998).
Des. Codes Cryptogr., 1999

Minimum Weight and Dimension Formulas for Some Geometric Codes.
Des. Codes Cryptogr., 1999

Steiner Systems From Binary Codes.
Ars Comb., 1999

1996
Designs and Codes: An update.
Des. Codes Cryptogr., 1996

1994
Codewords for Projective Planes from Sets of Type (<i>s, t</i>).
Eur. J. Comb., 1994

1993
On a Class of 1-Designs.
Eur. J. Comb., 1993

Codes of Steiner Triple and Quadruple Systems.
Des. Codes Cryptogr., 1993

1992
Designs and their codes.
Cambridge tracts in mathematics 103, Cambridge University Press, ISBN: 978-0-521-41361-9, 1992

1991
An upper bound for the <i>p</i>-rank of a translation plane.
J. Comb. Theory, Ser. A, 1991

Hermitian Varieties as Codewords.
Des. Codes Cryptogr., 1991

1990
Affine and projective planes.
Discret. Math., 1990

1989
Arcs and Ovals in the Hermitian and Ree Unitals.
Eur. J. Comb., 1989

1986
On an infinite class of steiner systems with <i>t</i> = 3 and <i>k</i> = 6.
J. Comb. Theory, Ser. A, 1986


  Loading...