Kevin T. Phelps

Publication Activity (10 Years)

Years Active: 1976-2015
Publications (10 Years): 0

Top Topics

Decoding Algorithm

Logical Operations

Error Correcting

Top Venues

IEEE Trans. Inf. Theory

Des. Codes Cryptogr.

Publications

Kevin T. Phelps
Enumeration of Kerdock codes of length 64. Des. Codes Cryptogr. 77 (2-3) (2015)
Kevin T. Phelps
Involutions in Additive 1-Perfect Codes. IEEE Trans. Inf. Theory 59 (10) (2013)
Cristina Fernández-Córdoba, Kevin T. Phelps, Mercè Villanueva
Involutions in Binary Perfect Codes. IEEE Trans. Inf. Theory 57 (9) (2011)
Cristina Fernández-Córdoba, Kevin T. Phelps
On the minimum distance graph of an extended Preparata code. Des. Codes Cryptogr. 57 (2) (2010)
Patric R. J. Östergård, Olli Pottonen, Kevin T. Phelps
The perfect binary one-error-correcting codes of length 15: part II-properties. IEEE Trans. Inf. Theory 56 (6) (2010)
Cristina Fernández-Córdoba, Kevin T. Phelps
On the minimum distance graph of an extended Preparata code CoRR (2009)
Patric R. J. Östergård, Olli Pottonen, Kevin T. Phelps
The Perfect Binary One-Error-Correcting Codes of Length 15: Part II--Properties CoRR (2009)
Joaquim Borges, Cristina Fernández-Córdoba, Kevin T. Phelps
ZRM Codes. IEEE Trans. Inf. Theory 54 (1) (2008)
Kevin T. Phelps, Mercè Villanueva
Intersection of Hadamard Codes. IEEE Trans. Inf. Theory 53 (5) (2007)
Kevin T. Phelps, Josep Rifà, Mercè Villanueva
-linear) Hadamard codes: rank and kernel. IEEE Trans. Inf. Theory 52 (1) (2006)
Kevin T. Phelps, Josep Rifà, Mercè Villanueva
Odd). Rank and Kernel. AAECC (2006)
Kevin T. Phelps, Josep Rifà, Mercè Villanueva
Rank and kernel of binary Hadamard codes. IEEE Trans. Inf. Theory 51 (11) (2005)
Kevin T. Phelps, Josep Rifà, Mercè Villanueva
-ary 1-Perfect Codes. Des. Codes Cryptogr. 37 (2) (2005)
Joaquim Borges, Cristina Fernandez, Kevin T. Phelps
Quaternary Reed-Muller codes. IEEE Trans. Inf. Theory 51 (7) (2005)
William B. Muse, Kevin T. Phelps
Orthogonal quadruple systems and 3-frames. J. Comb. Theory, Ser. A 104 (1) (2003)
Joaquim Borges, Kevin T. Phelps, Josep Rifà
-linear codes. IEEE Trans. Inf. Theory 49 (8) (2003)
Joaquim Borges, Kevin T. Phelps, Josep Rifà, Victor A. Zinoviev
-linear Preparata-like and Kerdock-like code. IEEE Trans. Inf. Theory 49 (11) (2003)
Kevin T. Phelps, Mercè Villanueva
On Perfect Codes: Rank and Kernel. Des. Codes Cryptogr. 27 (3) (2002)
Kevin T. Phelps, Josep Rifà
On binary 1-perfect additive codes: Some structural properties. IEEE Trans. Inf. Theory 48 (9) (2002)
Kevin T. Phelps, Mercè Villanueva
Ranks of q-Ary 1-Perfect Codes. Des. Codes Cryptogr. 27 (1-2) (2002)
Kevin T. Phelps
Combinatorial designs and perfect codes. Electron. Notes Discret. Math. 10 (2001)
Kevin T. Phelps, Mercè Villanueva
Bounds on the rank and kernel of perfect codes. Electron. Notes Discret. Math. 10 (2001)
Kevin T. Phelps
An enumeration of 1-perfect binary codes. Australas. J Comb. 21 (2000)
Kevin T. Phelps, Carol Yin
Generalized Steiner Systems With Block Size Three and Group Size Four. Ars Comb. 53 (1999)
Kevin T. Phelps, Mike LeVan
Nonsystematic Perfect codes. SIAM J. Discret. Math. 12 (1) (1999)
Italo J. Dejter, Kevin T. Phelps
Ternary Hamming and binary perfect covering codes. Codes and Association Schemes (1999)
Kevin T. Phelps, Mike LeVan
Switching Equivalence Classes of Perfect Codes. Des. Codes Cryptogr. 16 (2) (1999)
Simon Blake-Wilson, Kevin T. Phelps
Constant Weight Codes and Group Divisible Designs. Des. Codes Cryptogr. 16 (1) (1999)
Kevin T. Phelps, Mike LeVan
Kernels of Nonlinear Hamming Codes. Des. Codes Cryptogr. 6 (3) (1995)
David A. Grable, Kevin T. Phelps, Vojtech Rödl
The Minimum Independence Number for Designs. Comb. 15 (2) (1995)
László Babai, Haluk Oral, Kevin T. Phelps
Eulerian Self-Dual Codes. SIAM J. Discret. Math. 7 (2) (1994)
Kevin T. Phelps, Christopher A. Rodger
Nesting partial Steiner triple systems with 2-regular leave graphs. Discret. Math. 112 (1-3) (1993)
Hanno Lefmann, Kevin T. Phelps, Vojtech Rödl
Rigid Linear Binary Codes. J. Comb. Theory, Ser. A 63 (1) (1993)
Kevin T. Phelps, Marialuisa J. de Resmini
Partitioning twofold triple systems into complete arcs. Discret. Math. 104 (3) (1992)
Frank E. Bennett, Kevin T. Phelps, Christopher A. Rodger, Lie Zhu
Constructions of perfect Mendelsohn designs. Discret. Math. 103 (2) (1992)
Frank E. Bennett, Kevin T. Phelps, Christopher A. Rodger, J. Yin, Lie Zhu
Existence of perfect Mendelsohn designs with k=5 and lambda>1. Discret. Math. 103 (2) (1992)
Haluk Oral, Kevin T. Phelps
Almost All Self-Dual Codes Are Rigid. J. Comb. Theory, Ser. A 60 (2) (1992)
Charles J. Colbourn, Dean G. Hoffman, Kevin T. Phelps, Vojtech Rödl, Peter Winkler
The number of t-wise balance designs. Comb. 11 (3) (1991)
Charles Curtis Lindner, Kevin T. Phelps, Christopher A. Rodger
The spectrum for 2-perfect 6-cycle systems. J. Comb. Theory, Ser. A 57 (1) (1991)
Kevin T. Phelps, Scott A. Vanstone
Isomorphism of strong starters in cyclic groups. J. Comb. Theory, Ser. A 57 (2) (1991)
Dean G. Hoffman, Charles C. Lindner, Kevin T. Phelps
Blocking sets in designs with block size four II. Discret. Math. 89 (3) (1991)
Kevin T. Phelps
A class of 2-chromatic SQS(22). Discret. Math. 97 (1-3) (1991)
Charles J. Colbourn, Kevin T. Phelps, Marialuisa J. de Resmini, Alexander Rosa
Partitioning Steiner triple systems into complete arcs. Discret. Math. 89 (2) (1991)
Kevin T. Phelps
Halving block designs with block size four. Australas. J Comb. 3 (1991)
Dean G. Hoffman, Charles C. Lindner, Kevin T. Phelps
Blocking Sets in Designs with Block Size 4. Eur. J. Comb. 11 (5) (1990)
Kevin T. Phelps, Douglas R. Stinson, Scott A. Vanstone
(3, 4, v). Discret. Math. 77 (1-3) (1989)
Kevin T. Phelps, Alexander Rosa, Eric Mendelsohn
Cyclic Steiner Triple Systems with Cyclic Subsystems. Eur. J. Comb. 10 (4) (1989)
Kevin T. Phelps
. Discret. Math. 67 (1) (1987)
Kevin T. Phelps
Dual product constructions of Reed-Muller type codes. IEEE Trans. Inf. Theory 32 (1) (1986)
Kevin T. Phelps
Every finite group is the automorphism group of some perfect code. J. Comb. Theory, Ser. A 43 (1) (1986)
Kevin T. Phelps
A product construction for perfect codes over arbitrary alphabets. IEEE Trans. Inf. Theory 30 (5) (1984)
Kevin T. Phelps, Vojtech Rödl
On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems. Comb. 4 (1) (1984)
Kevin T. Phelps, Charles C. Lindner
On the Number of Mendelsohn and Transitive Triple Systems. Eur. J. Comb. 5 (3) (1984)
Charles J. Colbourn, Marlene J. Colbourn, Kevin T. Phelps, Vojtech Rödl
Colouring steiner quadruple systems. Discret. Appl. Math. 4 (2) (1982)
Kevin T. Phelps, Alexander Rosa
Steiner triple systems with rotational automorphisms. Discret. Math. 33 (1) (1981)
Kevin T. Phelps
Automorphism free latin square graphs. Discret. Math. 31 (2) (1980)
Kevin T. Phelps, Alexander Rosa
2-Chromatic Steiner Quadruple Systems. Eur. J. Comb. 1 (3) (1980)
Kevin T. Phelps
Conjugate Orthogonal Quasigroups. J. Comb. Theory, Ser. A 25 (2) (1978)
Charles C. Lindner, Kevin T. Phelps
A Note on Partial Parallel Classes in Steiner Systems. Discret. Math. 24 (1) (1978)
Kevin T. Phelps
Some Sufficient Conditions for a Steiner Triple System to Be a Derived Triple System. J. Comb. Theory, Ser. A 20 (3) (1976)
Kevin T. Phelps
Some derived steiner triple systems. Discret. Math. 16 (4) (1976)