#### Filter Results:

- Full text PDF available (2)

#### Publication Year

1977

1992

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Robert J. McEliece, Eugene R. Rodemich, Howard Rumsey, Lloyd R. Welch
- IEEE Trans. Information Theory
- 1977

With the Delsarte-MacWilliams inequalities as a starting point, an upper bound is obtained on the rate of a binary code as a function of its minimum distance. This upper bound is asymptotically less than Levenshtein's bound, and so also Elias's.

- W. H. Mills, David P. Robbins, Howard Rumsey
- J. Comb. Theory, Ser. A
- 1983

An alternating sign matrix is a square matrix such that (i) all entries are 1,-1, or 0, (ii) every row and column has sum 1, and (iii) in every row and column the nonzero entries alternate in sign. Striking numerical evidence of a connection between these matrices and the descending plane partitions introduced by Andrews (Invent. Math. 53 (1979), 193-225)… (More)

- W. H. Mills, David P. Robbins, Howard Rumsey
- Discrete Mathematics
- 1987

- W. H. Mills, David P. Robbins, Howard Rumsey
- J. Comb. Theory, Ser. A
- 1986

- Edward A. Bender, Raymond Coley, David P. Robbins, Howard Rumsey
- J. Comb. Theory, Ser. A
- 1992

- ‹
- 1
- ›