| 2009 |
|---|
| 46 | EE | Cristina Fernández-Córdoba,
Kevin T. Phelps:
On the minimum distance graph of an extended Preparata code
CoRR abs/0902.1351: (2009) |
| 45 | EE | Patric R. J. Östergård,
Olli Pottonen,
Kevin T. Phelps:
The Perfect Binary One-Error-Correcting Codes of Length 15: Part II--Properties
CoRR abs/0903.2749: (2009) |
| 2008 |
|---|
| 44 | EE | Joaquim Borges,
Cristina Fernández-Córdoba,
Kevin T. Phelps:
ZRM Codes.
IEEE Transactions on Information Theory 54(1): 380-386 (2008) |
| 2007 |
|---|
| 43 | EE | Kevin T. Phelps,
Mercè Villanueva:
Intersection of Hadamard Codes.
IEEE Transactions on Information Theory 53(5): 1924-1928 (2007) |
| 2006 |
|---|
| 42 | EE | Kevin T. Phelps,
Josep Rifà,
Mercè Villanueva:
Hadamard Codes of Length 2ts (s Odd). Rank and Kernel.
AAECC 2006: 328-337 |
| 41 | EE | Kevin T. Phelps,
Josep Rifà,
Mercè Villanueva:
On the additive (/spl Zopf//sub 4/-linear and non-/spl Zopf//sub 4/-linear) Hadamard codes: rank and kernel.
IEEE Transactions on Information Theory 52(1): 316-319 (2006) |
| 2005 |
|---|
| 40 | EE | Kevin T. Phelps,
Josep Rifà,
Mercè Villanueva:
Kernels and p-Kernels of pr-ary 1-Perfect Codes.
Des. Codes Cryptography 37(2): 243-261 (2005) |
| 39 | EE | Kevin T. Phelps,
Josep Rifà,
Mercè Villanueva:
Rank and kernel of binary Hadamard codes.
IEEE Transactions on Information Theory 51(11): 3931-3937 (2005) |
| 38 | EE | Joaquim Borges,
Cristina Fernandez,
Kevin T. Phelps:
Quaternary Reed-Muller codes.
IEEE Transactions on Information Theory 51(7): 2686-2691 (2005) |
| 2003 |
|---|
| 37 | | Joaquim Borges,
Kevin T. Phelps,
Josep Rifà,
Victor A. Zinoviev:
On Z4-linear Preparata-like and Kerdock-like code.
IEEE Transactions on Information Theory 49(11): 2834-2843 (2003) |
| 36 | | Joaquim Borges,
Kevin T. Phelps,
Josep Rifà:
The rank and kernel of extended 1-perfect Z4-linear and additive non-Z4-linear codes.
IEEE Transactions on Information Theory 49(8): 2028-2034 (2003) |
| 35 | EE | William B. Muse,
Kevin T. Phelps:
Orthogonal quadruple systems and 3-frames.
J. Comb. Theory, Ser. A 104(1): 115-124 (2003) |
| 2002 |
|---|
| 34 | | Kevin T. Phelps,
Mercè Villanueva:
Ranks of q-Ary 1-Perfect Codes.
Des. Codes Cryptography 27(1-2): 139-144 (2002) |
| 33 | | Kevin T. Phelps,
Mercè Villanueva:
On Perfect Codes: Rank and Kernel.
Des. Codes Cryptography 27(3): 183-194 (2002) |
| 32 | | Kevin T. Phelps,
Josep Rifà:
On binary 1-perfect additive codes: Some structural properties.
IEEE Transactions on Information Theory 48(9): 2587-2592 (2002) |
| 2001 |
|---|
| 31 | EE | Kevin T. Phelps:
Combinatorial designs and perfect codes.
Electronic Notes in Discrete Mathematics 10: 220-234 (2001) |
| 30 | EE | Kevin T. Phelps,
Mercè Villanueva:
Bounds on the rank and kernel of perfect codes.
Electronic Notes in Discrete Mathematics 10: 235-237 (2001) |
| 1999 |
|---|
| 29 | | Kevin T. Phelps,
Carol Yin:
Generalized Steiner Systems With Block Size Three and Group Size Four.
Ars Comb. 53: (1999) |
| 28 | | Simon Blake-Wilson,
Kevin T. Phelps:
Constant Weight Codes and Group Divisible Designs.
Des. Codes Cryptography 16(1): 11-27 (1999) |
| 27 | | Kevin T. Phelps,
Mike LeVan:
Switching Equivalence Classes of Perfect Codes.
Des. Codes Cryptography 16(2): 179-184 (1999) |
| 26 | EE | Kevin T. Phelps,
Mike LeVan:
Nonsystematic Perfect codes.
SIAM J. Discrete Math. 12(1): 27-34 (1999) |
| 1995 |
|---|
| 25 | | David A. Grable,
Kevin T. Phelps,
Vojtech Rödl:
The Minimum Independence Number for Designs.
Combinatorica 15(2): 175-185 (1995) |
| 24 | | Kevin T. Phelps,
Mike LeVan:
Kernels of Nonlinear Hamming Codes.
Des. Codes Cryptography 6(3): 247-257 (1995) |
| 1994 |
|---|
| 23 | EE | László Babai,
Haluk Oral,
Kevin T. Phelps:
Eulerian Self-Dual Codes.
SIAM J. Discrete Math. 7(2): 325-330 (1994) |
| 1993 |
|---|
| 22 | EE | Kevin T. Phelps,
Christopher A. Rodger:
Nesting partial Steiner triple systems with 2-regular leave graphs.
Discrete Mathematics 112(1-3): 165-172 (1993) |
| 21 | | Hanno Lefmann,
Kevin T. Phelps,
Vojtech Rödl:
Rigid Linear Binary Codes.
J. Comb. Theory, Ser. A 63(1): 110-128 (1993) |
| 1992 |
|---|
| 20 | EE | Frank E. Bennett,
Kevin T. Phelps,
Christopher A. Rodger,
J. Yin,
Lie Zhu:
Existence of perfect Mendelsohn designs with k=5 and lambda>1.
Discrete Mathematics 103(2): 129-137 (1992) |
| 19 | EE | Frank E. Bennett,
Kevin T. Phelps,
Christopher A. Rodger,
Lie Zhu:
Constructions of perfect Mendelsohn designs.
Discrete Mathematics 103(2): 139-151 (1992) |
| 18 | EE | Kevin T. Phelps,
Marialuisa J. de Resmini:
Partitioning twofold triple systems into complete arcs.
Discrete Mathematics 104(3): 273-280 (1992) |
| 17 | | Haluk Oral,
Kevin T. Phelps:
Almost All Self-Dual Codes Are Rigid.
J. Comb. Theory, Ser. A 60(2): 264-276 (1992) |
| 1991 |
|---|
| 16 | | Charles J. Colbourn,
Dean G. Hoffman,
Kevin T. Phelps,
Vojtech Rödl,
Peter Winkler:
The number of t-wise balance designs.
Combinatorica 11(3): 207-218 (1991) |
| 15 | EE | Charles J. Colbourn,
Kevin T. Phelps,
Marialuisa J. de Resmini,
Alexander Rosa:
Partitioning Steiner triple systems into complete arcs.
Discrete Mathematics 89(2): 149-160 (1991) |
| 14 | EE | Dean G. Hoffman,
Charles C. Lindner,
Kevin T. Phelps:
Blocking sets in designs with block size four II.
Discrete Mathematics 89(3): 221-229 (1991) |
| 13 | EE | Kevin T. Phelps:
A class of 2-chromatic SQS(22).
Discrete Mathematics 97(1-3): 333-338 (1991) |
| 12 | EE | Charles Curtis Lindner,
Kevin T. Phelps,
Christopher A. Rodger:
The spectrum for 2-perfect 6-cycle systems.
J. Comb. Theory, Ser. A 57(1): 76-85 (1991) |
| 11 | EE | Kevin T. Phelps,
Scott A. Vanstone:
Isomorphism of strong starters in cyclic groups.
J. Comb. Theory, Ser. A 57(2): 287-293 (1991) |
| 1989 |
|---|
| 10 | EE | Kevin T. Phelps,
Douglas R. Stinson,
Scott A. Vanstone:
The existence of simple S3(3, 4, v).
Discrete Mathematics 77(1-3): 255-258 (1989) |
| 1987 |
|---|
| 9 | EE | Kevin T. Phelps:
A construction of cyclic Steiner triple systems of order pn.
Discrete Mathematics 67(1): 107-110 (1987) |
| 1986 |
|---|
| 8 | | Kevin T. Phelps:
Dual product constructions of Reed-Muller type codes.
IEEE Transactions on Information Theory 32(1): 103- (1986) |
| 7 | EE | Kevin T. Phelps:
Every finite group is the automorphism group of some perfect code.
J. Comb. Theory, Ser. A 43(1): 45-51 (1986) |
| 1984 |
|---|
| 6 | | Kevin T. Phelps,
Vojtech Rödl:
On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems.
Combinatorica 4(1): 79-88 (1984) |
| 5 | | Kevin T. Phelps:
A product construction for perfect codes over arbitrary alphabets.
IEEE Transactions on Information Theory 30(5): 769- (1984) |
| 1981 |
|---|
| 4 | EE | Kevin T. Phelps,
Alexander Rosa:
Steiner triple systems with rotational automorphisms.
Discrete Mathematics 33(1): 57-66 (1981) |
| 1980 |
|---|
| 3 | EE | Kevin T. Phelps:
Automorphism free latin square graphs.
Discrete Mathematics 31(2): 193-200 (1980) |
| 1978 |
|---|
| 2 | | Kevin T. Phelps:
Conjugate Orthogonal Quasigroups.
J. Comb. Theory, Ser. A 25(2): 117-127 (1978) |
| 1976 |
|---|
| 1 | | Kevin T. Phelps:
Some Sufficient Conditions for a Steiner Triple System to Be a Derived Triple System.
J. Comb. Theory, Ser. A 20(3): 393-397 (1976) |
