- Full text PDF available (4)
- 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)
weight distribution of linear codes over GF (q l) having generator matrices over GF (q)," \New upper bound on the rate of a code via the Delsarte-MacWilliams inequalities," IEEE Trans.
RU4LEtWH&!4sl-A'ERG RU4LEtWH&!4sl Fig. 1. Fig. 1. Entropy per cell as function of average run length. Entropy per cell as function of average run length. distributed: for tl 2 0 for tl < 0 where t, is the (continuous) run length. The average run length is f, = 6. (20) Now, suppose the continuous run length tl is quantized to obtain the discrete run length t… (More)