- Full text PDF available (3)
- This year (0)
- Last 5 years (0)
- Last 10 years (0)
Journals and Conferences
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.
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)
P(0 IO) = P(1 1 1) = 9. Therefore, although Capon apparently did not realize it, the saving in bits predicted by his model is actually a lower bound for any two-level source with average white run length l/ (1 P(l 1 1)) and average black run length l/(1 P(0 IO)), because the run lengths in Capon’s model are independent, and the exponential distributions of… (More)
A radar brightness map of Venus has been obtain d. It reveals interesting surface features and much structure over a large area.