论文信息 - Zero-error capacities and very different sequences

Zero-error capacities and very different sequences

Perfect hash functions, superimposed codes as well as some other fashionable questions in computer science and random-access communication are special cases of early-day information theoretic models in the zero-error case.

Gérard D. Cohen | Gábor Simonyi | János Körner

[1] László Lovász,et al. On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[2] Robert B. Ash,et al. Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[3] Noga Alon,et al. Explicit construction of exponential sized families of k-independent sets , 1986, Discret. Math..

[4] Claude E. Shannon,et al. The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[5] D. Blackwell,et al. The Capacity of a Class of Channels , 1959 .

[6] I. Csiszár,et al. On the capacity of the arbitrarily varying channel for maximum probability of error , 1981 .

[7] János Körner,et al. On the capacity of uniform hypergraphs , 1990, IEEE Trans. Inf. Theory.

[8] Zsolt Tuza,et al. On the maximum number of qualitatively independent partitions , 1989, J. Comb. Theory, Ser. A.

[9] László Lovász,et al. Entropy splitting for antiblocking corners and perfect graphs , 1990, Comb..

[10] Willem H. Haemers,et al. On Some Problems of Lovász Concerning the Shannon Capacity of a Graph , 1979, IEEE Trans. Inf. Theory.

[11] Gábor Simonyi,et al. Separating Partition Systems and Locally Different Sequences , 1988, SIAM J. Discret. Math..