A Note on Counting Very Different Sequences

Authors:
Emanuela Fachini;Já/nos Kö/rner
Affiliations:
Department of Computer Science, University of Rome I ‘/La Sapienza’/, Via Salaria 113, 00198 Roma, Italy/ (e-mail: fachini@dsi.uniroma1.it, korner@dsi.uniroma1.it);Department of Computer Science, University of Rome I ‘/La Sapienza’/, Via Salaria 113, 00198 Roma, Italy/ (e-mail: fachini@dsi.uniroma1.it, korner@dsi.uniroma1.it)
Venue:
Combinatorics, Probability and Computing
Year:
2001

Citing 3
Cited 2

Fredman-Kolmo´s bounds and information theory

SIAM Journal on Algebraic and Discrete Methods
Zero-error capacities and very different sequences

Sequences
Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems

Distributed multi-broadcast in unknown radio networks

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Distributed broadcast in radio networks of unknown topology

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We strengthen the Cohen–Körner–Simonyi upper bound on counting ‘very different sequences’.