The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kevin T. Phelps: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  42. On the minimum distance graph of an extended Preparata code [Citation Graph (, )][DBLP]


  43. The Perfect Binary One-Error-Correcting Codes of Length 15: Part II--Properties [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002