Kevin T. Phelps

发表

Enumeration of Kerdock codes of length 64

Kevin T. Phelps, 2015, Des. Codes Cryptogr..

On the algorithmic complexity of coloring simple hypergraphs and steiner triple systems

Vojtech Rödl, Kevin T. Phelps, V. Rödl, 1984, Comb..

Coding Theory: The Essentials

Kevin T. Phelps, Christopher A. Rodger, D. G. Hoffman, 1991 .

Intersection of Hadamard Codes

Kevin T. Phelps, Mercè Villanueva, K. Phelps, 2007, IEEE Transactions on Information Theory.

search-an update. In Cracking DES : of "black-box" cryptography,

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

On the minimum distance graph of an extended Preparata code

Kevin T. Phelps, Cristina Fernández-Córdoba, 2010, Des. Codes Cryptogr..

On the additive (/spl Zopf//sub 4/-linear and non-/spl Zopf//sub 4/-linear) Hadamard codes: rank and kernel

Kevin T. Phelps, Josep Rifà, Mercè Villanueva, 2006, IEEE Transactions on Information Theory.

Ternary Hamming and binary perfect covering codes

Kevin T. Phelps, Italo J. Dejter, K. Phelps, 1999, Codes and Association Schemes.

Constructions of perfect Mendelsohn designs

Kevin T. Phelps, Lie Zhu, Christopher A. Rodger, 1992, Discret. Math..

2-Chromatic Steiner Quadruple Systems

Kevin T. Phelps, Alexander Rosa, 1980, Eur. J. Comb..

If the keyword was chosen from a dictionary, then it may be especially easy to

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

Colouring steiner quadruple systems

Vojtech Rödl, Kevin T. Phelps, Charles J. Colbourn, 1982, Discret. Appl. Math..

A product construction for perfect codes over arbitrary alphabets

Kevin T. Phelps, 1984, IEEE Trans. Inf. Theory.

On the Number of Mendelsohn and Transitive Triple Systems

Kevin T. Phelps, Charles C. Lindner, 1984, Eur. J. Comb..

Involutions in Additive 1-Perfect Codes

Kevin T. Phelps, 2013, IEEE Transactions on Information Theory.

Introduction to Coding Theory : 1.1 Introduction of methods for efficient and accurate transfer of infor- of noise from compact disc recordings, the trans- of financial information across telephone lines, data transfer from one

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

of the one-time pad, DES was designed so that it would be "computationally : of cryptographic tools or prim- of strings of symbols from the alpha- if 5l = {0, then messages consist of strings of Os and

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

Bounds on the rank and kernel of perfect codes

Kevin T. Phelps, Mercè Villanueva, 2001, Electron. Notes Discret. Math..

Hadamard Codes of Length 2ts (s Odd). Rank and Kernel

Kevin T. Phelps, Josep Rifà, Mercè Villanueva, 2006, AAECC.

The rank and kernel of extended 1-perfect Z4-linear and additive non-Z4-linear codes

Kevin T. Phelps, Josep Rifà, Joaquim Borges, 2003, IEEE Trans. Inf. Theory.

Rigid Linear Binary Codes

Vojtech Rödl, Kevin T. Phelps, Hanno Lefmann, 1993, J. Comb. Theory, Ser. A.

A class of 2-chromatic SQS(22)

Kevin T. Phelps, 1991, Discret. Math..

Existence of perfect Mendelsohn designs with k=5 and lambda>1

Kevin T. Phelps, Lie Zhu, Christopher A. Rodger, 1992, Discret. Math..

Steiner triple systems with rotational automorphisms

Kevin T. Phelps, Alexander Rosa, 1981, Discret. Math..

of these ciphers; readers interested in the details of DES should

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

Conjugate Orthogonal Quasigroups

Kevin T. Phelps, K. Phelps, 1978, J. Comb. Theory, Ser. A.

On Z4-linear Preparata-like and Kerdock-like code

Kevin T. Phelps, Victor Zinoviev, Josep Rifà, 2003, IEEE Trans. Inf. Theory.

Ranks of q-Ary 1-Perfect Codes

Kevin T. Phelps, Mercè Villanueva, K. Phelps, 2002, Des. Codes Cryptogr..

Cyclic Steiner Triple Systems with Cyclic Subsystems

Kevin T. Phelps, Alexander Rosa, Eric Mendelsohn, 1989, Eur. J. Comb..

Isomorphism of strong starters in cyclic groups

Kevin T. Phelps, Scott A. Vanstone, S. Vanstone, 1991, J. Comb. Theory, Ser. A.

ZRM Codes

Kevin T. Phelps, Joaquim Borges, Cristina Fernández-Córdoba, 2008, IEEE Transactions on Information Theory.

A construction of cyclic Steiner triple systems of order pn

Kevin T. Phelps, 1987, Discret. Math..

Partitioning Steiner triple systems into complete arcs

Kevin T. Phelps, Charles J. Colbourn, Alexander Rosa, 1991, Discret. Math..

Almost All Self-Dual Codes Are Rigid

Kevin T. Phelps, Haluk Oral, 1992, J. Comb. Theory, Ser. A.

Every finite group is the automorphism group of some perfect code

Kevin T. Phelps, 1986, J. Comb. Theory, Ser. A.

A Note on Partial Parallel Classes in Steiner Systems

Kevin T. Phelps, Charles C. Lindner, 1978, Discret. Math..

Blocking Sets in Designs with Block Size 4

Kevin T. Phelps, Dean G. Hoffman, Charles C. Lindner, 1990, Eur. J. Comb..

Halving block designs with block size four

Kevin T. Phelps, 1991, Australas. J Comb..

Kernels of nonlinear Hamming codes

Kevin T. Phelps, Mike LeVan, K. Phelps, 1995, Des. Codes Cryptogr..

Let C be an RS(Y, 8) which is used to transmit messages and let : of erasure locations and let A be the set of error locations; of error locations which are not erasure locations. Define f1 +x)

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

of the encoder and the decoder. Our desire

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

Nesting partial Steiner triple systems with 2-regular leave graphs

Kevin T. Phelps, Christopher A. Rodger, 1993, Discret. Math..

2 Introduction to cyclic codes : of a class of codes, called cyclic codes. Eventually we of cyclic codes to construct a generating matrix

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

Dual product constructions of Reed-Muller type codes

Kevin T. Phelps, 1986, IEEE Trans. Inf. Theory.

The spectrum for 2-perfect 6-cycle systems

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 1991, J. Comb. Theory, Ser. A.

Switching Equivalence Classes of Perfect Codes

Kevin T. Phelps, Mike LeVan, 1999, Des. Codes Cryptogr..

Quaternary Reed-Muller codes

Kevin T. Phelps, Joaquim Borges, Cristina Fernandez, 2005, IEEE Transactions on Information Theory.

The existence of simple S3(3, 4, v)

Kevin T. Phelps, Douglas R. Stinson, Scott A. Vanstone, 1989, Discret. Math..

The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties

Kevin T. Phelps, Patric R. J. Östergård, Olli Pottonen, 2009, IEEE Transactions on Information Theory.

Some Sufficient Conditions for a Steiner Triple System to Be a Derived Triple System

Kevin T. Phelps, 1976, J. Comb. Theory, Ser. A.

Involutions in Binary Perfect Codes

Kevin T. Phelps, Cristina Fernández-Córdoba, Mercè Villanueva, 2011, IEEE Transactions on Information Theory.

Partitioning twofold triple systems into complete arcs

Kevin T. Phelps, Marialuisa J. de Resmini, 1992, Discret. Math..

An enumeration of 1-perfect binary codes

Kevin T. Phelps, K. Phelps, 2000, Australas. J Comb..

Orthogonal quadruple systems and 3-frames

Kevin T. Phelps, William B. Muse, K. Phelps, 2003, J. Comb. Theory, Ser. A.

Blocking sets in designs with block size four II

Kevin T. Phelps, Dean G. Hoffman, Charles C. Lindner, 1991, Discret. Math..

Rank and kernel of binary Hadamard codes

Kevin T. Phelps, Josep Rifà, Mercè Villanueva, 2005, IEEE Transactions on Information Theory.

Generalized Steiner Systems With Block Size Three and Group Size Four

Kevin T. Phelps, Carol Yin, 1999, Ars Comb..

Constant Weight Codes and Group Divisible Designs

Kevin T. Phelps, Simon Blake-Wilson, K. Phelps, 1999, Des. Codes Cryptogr..

= = = : of Algorithm 6.3.2, the original syndromes and (6.7):

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

Combinatorial designs and perfect codes

Kevin T. Phelps, K. Phelps, 2001, Electron. Notes Discret. Math..

Some derived steiner triple systems

Kevin T. Phelps, 1976, Discret. Math..

On binary 1-perfect additive codes: Some structural properties

Kevin T. Phelps, Josep Rifà, 2002, IEEE Trans. Inf. Theory.

The number oft-wise balanced designs

Vojtech Rödl, Kevin T. Phelps, Peter Winkler, 1991, Comb..

The minimum independence number for designs

Vojtech Rödl, Kevin T. Phelps, David A. Grable, 1995, Comb..

Kernels and p-Kernels of pr-ary 1-Perfect Codes

Kevin T. Phelps, Josep Rifà, Mercè Villanueva, 2005, Des. Codes Cryptogr..

On Perfect Codes: Rank and Kernel

Kevin T. Phelps, Mercè Villanueva, 2002, Des. Codes Cryptogr..

Eulerian Self-Dual Codes

Kevin T. Phelps, László Babai, Haluk Oral, 1994, SIAM J. Discret. Math..

Coloring Steiner Triple Systems

Vojtech Rödl, Kevin T. Phelps, V. Rödl, 1982 .

Random methods in design theory: A survey

Kevin T. Phelps, David A. Grable, 1996 .

Generalized Steiner systems with block size three and group sizeg ? 3(mod 6)

Kevin T. Phelps, K. Phelps, Carol Yin, 1997 .

Coloring Block Designs is NP-Complete

Vojtech Rödl, Kevin T. Phelps, Charles J. Colbourn, 1982 .

Block Sizes in Pairwise Balanced Designs

Kevin T. Phelps, Charles J. Colbourn, Vojtěch Rödl, 1984, Canadian Mathematical Bulletin.

Addendum: “A class of Steiner triple systems of order 21 and associated Kirkman systems” [Math. Comp. 37 (1981), no. 155, 209–222; MR0616374 (82k:05022)]

Kevin T. Phelps, Alexander Rosa, Rudolf Mathon, 1995 .

Coding Theory and Cryptography : The Essentials

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2022 .

A class of Steiner triple systems of order 21 and associated Kirkman systems

Kevin T. Phelps, Alexander Rosa, Rudolf Mathon, 1981 .

Extremal problems for triple systems

Kevin T. Phelps, Hanno Lefmann, Vojtěch Rödl, 1993 .

On the additive ( Z 4-linear and non-Z 4-linear ) Hadamard codes . Rank and Kernel

Kevin T. Phelps, Josep Rifà, Mercè Villanueva, 2005 .