Creating Order in Sequence Spaces with Simple Machines
暂无分享,去创建一个
[1] Kingo Kobayashi,et al. Combinatorial structure and capacity of the permuting relay channel , 1987, IEEE Trans. Inf. Theory.
[2] Rudolf Ahlswede,et al. Contributions to a theory of ordering for sequence spaces , 1989 .
[3] Jacob Ziv,et al. Coding theorems for individual sequences , 1978, IEEE Trans. Inf. Theory.
[4] Rudolf Ahlswede,et al. Coloring hypergraphs: A new approach to multi-user source coding, 1 , 1979 .
[5] L. Brillouin,et al. Science and information theory , 1956 .
[6] Rudolf Ahlswede,et al. Search Problems , 1987 .
[7] Pierre A. Humblet,et al. Protocols for encoding idle characters in data streams , 1981 .
[8] Rudolf Ahlswede,et al. Channel capacities for list codes , 1973, Journal of Applied Probability.
[9] Donald E. Knuth,et al. Sorting and Searching , 1973 .
[10] Claude E. Shannon,et al. The mathematical theory of communication , 1950 .
[11] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[12] Rudolf Ahlswede,et al. Optimal coding strategies for certain permuting channels , 1987, IEEE Trans. Inf. Theory.
[13] C. Shannon,et al. The bandwagon (Edtl.) , 1956 .