Random access communication and graph entropy

DOI10.1109/18.2639MaRDI QIDQ3820526zbMATH OpenOpenAlexFDO

Authors

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

conflict resultionhashing

Mathematics Subject Classification ID

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

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3820526)