According to our database
1,
Kevin T. Phelps
authored at least 59 papers
between 1976 and 2015.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2015
Enumeration of Kerdock codes of length 64.
Des. Codes Cryptogr., 2015
2013
Involutions in Additive 1-Perfect Codes.
IEEE Trans. Inf. Theory, 2013
2011
Involutions in Binary Perfect Codes.
IEEE Trans. Inf. Theory, 2011
2010
The perfect binary one-error-correcting codes of length 15: part II-properties.
IEEE Trans. Inf. Theory, 2010
On the minimum distance graph of an extended Preparata code.
Des. Codes Cryptogr., 2010
2008
IEEE Trans. Inf. Theory, 2008
2007
Intersection of Hadamard Codes.
IEEE Trans. Inf. Theory, 2007
2006
On the additive (ℤ<sub>4</sub>-linear and non-ℤ<sub>4</sub>-linear) Hadamard codes: rank and kernel.
IEEE Trans. Inf. Theory, 2006
Hadamard Codes of Length 2<sup><i>t</i></sup><i>s</i> (<i>s</i> Odd). Rank and Kernel.
Proceedings of the Applied Algebra, 2006
2005
Rank and kernel of binary Hadamard codes.
IEEE Trans. Inf. Theory, 2005
Quaternary Reed-Muller codes.
IEEE Trans. Inf. Theory, 2005
Kernels and <i>p</i>-Kernels of <i>p</i><sup><i>r</i></sup>-ary 1-Perfect Codes.
Des. Codes Cryptogr., 2005
2003
On Z<sub>4</sub>-linear Preparata-like and Kerdock-like code.
IEEE Trans. Inf. Theory, 2003
The rank and kernel of extended 1-perfect Z<sub>4</sub>-linear and additive non-Z<sub>4</sub>-linear codes.
IEEE Trans. Inf. Theory, 2003
Orthogonal quadruple systems and 3-frames.
J. Comb. Theory, Ser. A, 2003
2002
On binary 1-perfect additive codes: Some structural properties.
IEEE Trans. Inf. Theory, 2002
On Perfect Codes: Rank and Kernel.
Des. Codes Cryptogr., 2002
Ranks of q-Ary 1-Perfect Codes.
Des. Codes Cryptogr., 2002
2001
Bounds on the rank and kernel of perfect codes.
Electron. Notes Discret. Math., 2001
Combinatorial designs and perfect codes.
Electron. Notes Discret. Math., 2001
2000
An enumeration of 1-perfect binary codes.
Australas. J Comb., 2000
1999
Nonsystematic Perfect codes.
SIAM J. Discret. Math., 1999
Switching Equivalence Classes of Perfect Codes.
Des. Codes Cryptogr., 1999
Constant Weight Codes and Group Divisible Designs.
Des. Codes Cryptogr., 1999
Generalized Steiner Systems With Block Size Three and Group Size Four.
Ars Comb., 1999
Ternary Hamming and binary perfect covering codes.
Proceedings of the Codes and Association Schemes, 1999
1995
Kernels of Nonlinear Hamming Codes.
Des. Codes Cryptogr., 1995
The Minimum Independence Number for Designs.
Comb., 1995
1994
Eulerian Self-Dual Codes.
SIAM J. Discret. Math., 1994
1993
Rigid Linear Binary Codes.
J. Comb. Theory, Ser. A, 1993
Nesting partial Steiner triple systems with 2-regular leave graphs.
Discret. Math., 1993
1992
Almost All Self-Dual Codes Are Rigid.
J. Comb. Theory, Ser. A, 1992
Partitioning twofold triple systems into complete arcs.
Discret. Math., 1992
Constructions of perfect Mendelsohn designs.
Discret. Math., 1992
Existence of perfect Mendelsohn designs with k=5 and lambda>1.
Discret. Math., 1992
1991
Isomorphism of strong starters in cyclic groups.
J. Comb. Theory, Ser. A, 1991
The spectrum for 2-perfect 6-cycle systems.
J. Comb. Theory, Ser. A, 1991
A class of 2-chromatic SQS(22).
Discret. Math., 1991
Blocking sets in designs with block size four II.
Discret. Math., 1991
Partitioning Steiner triple systems into complete arcs.
Discret. Math., 1991
The number of t-wise balance designs.
Comb., 1991
Halving block designs with block size four.
Australas. J Comb., 1991
1990
Blocking Sets in Designs with Block Size 4.
Eur. J. Comb., 1990
1989
Cyclic Steiner Triple Systems with Cyclic Subsystems.
Eur. J. Comb., 1989
The existence of simple S<sub>3</sub>(3, 4, v).
Discret. Math., 1989
1987
A construction of cyclic Steiner triple systems of order p<sup>n</sup>.
Discret. Math., 1987
1986
Dual product constructions of Reed-Muller type codes.
IEEE Trans. Inf. Theory, 1986
Every finite group is the automorphism group of some perfect code.
J. Comb. Theory, Ser. A, 1986
1984
A product construction for perfect codes over arbitrary alphabets.
IEEE Trans. Inf. Theory, 1984
On the Number of Mendelsohn and Transitive Triple Systems.
Eur. J. Comb., 1984
On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems.
Comb., 1984
1982
Colouring steiner quadruple systems.
Discret. Appl. Math., 1982
1981
Steiner triple systems with rotational automorphisms.
Discret. Math., 1981
1980
2-Chromatic Steiner Quadruple Systems.
Eur. J. Comb., 1980
Automorphism free latin square graphs.
Discret. Math., 1980
1978
Conjugate Orthogonal Quasigroups.
J. Comb. Theory, Ser. A, 1978
A Note on Partial Parallel Classes in Steiner Systems.
Discret. Math., 1978
1976
Some Sufficient Conditions for a Steiner Triple System to Be a Derived Triple System.
J. Comb. Theory, Ser. A, 1976
Some derived steiner triple systems.
Discret. Math., 1976
