Random access communication and graph entropy

DOI10.1109/18.2639zbMath0667.94001OpenAlexW2075200743MaRDI QIDQ3820526

No author found.

Publication date: 1988

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.2639

zbMATH Keywords

hashingconflict resultion

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Combinatorial probability (60C05) Measures of information, entropy (94A17) Communication theory (94A05)

Related Items (3)

Detecting causal relations in time series with the new cross Markov matrix technique ⋮ Some results towards the Dittert conjecture on permanents ⋮ On the algebraic and topological structure of the set of Turán densities

This page was built for publication: Random access communication and graph entropy