Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
binary entropy function
Description:
A function measuring the Shannon entropy of a binary probability distribution, used in information theory, statistics, and coding theory.
Related topics:
Coding theory and cryptography (15%),
Error Correcting Code Techniques (14%),
Complexity and Algorithms in Graphs (9%)
Wikidata ID:
wiki/Q4913893
OpenAlex ID:
keywords/binary-entropy-function
Good quantum error-correcting codes exist
1996
·
A. R. Calderbank
, Peter W. Shor
·
Physical Review A
·
3,520
PDF
A nonconstructive upper bound on covering radius
1983
·
G. Cohen
·
IEEE Transactions on Information Theory
·
69
Secret-Sharing Schemes for General and Uniform Access Structures
2019
·
Benny Applebaum
, Amos Beimel
, et al.
·
Lecture notes in computer science
·
64
Capacity and Coding for the Ising Channel With Feedback
2014
·
Ohad Elishco
, Haim Permuter
·
IEEE Transactions on Information Theory
·
63
PDF
Information theory and the complexity of boolean functions
1976
·
Nicholas Pippenger
·
Theory of Computing Systems
·
59
Total Path Length for Random Recursive Trees
1999
·
ROBERT P. DOBROW
, JAMES ALLEN FILL
·
Combinatorics Probability Computing
·
56
Identification without randomization
1999
·
R. Ahlswede
, Ning Cai
·
IEEE Transactions on Information Theory
·
50
A binary analog to the entropy-power inequality
1990
·
S. Shamai
, A.D. Wyner
·
IEEE Transactions on Information Theory
·
40
Binary causal-adversary channels
2009
·
M. Langberg
, S. Jaggi
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
34
PDF
Hausdorff dimension in exponential time
2002
·
K. Ambos-Spies
, W. Merkle
, et al.
·
IEEE Conference on Computational Complexity (CCC)
·
32
Extending Matchgate Simulation Methods to Universal Quantum Circuits
2023
·
Mocherla, Avinash
, Lao, Lingling
, et al.
·
arXiv (Cornell University)
·
27
PDF
Threshold optimization for capacity-achieving discrete input one-bit output quantization
2013
·
Rudolf Mathar
, Meik Dorpinghaus
·
IEEE International Symposium on Information Theory (ISIT)
·
25
PDF
Beating the Gilbert-Varshamov bound for online channels
2011
·
Ishay Haviv
, Michael Langberg
·
IEEE International Symposium on Information Theory (ISIT)
·
17
PDF
Improved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function
2000
·
Andris Ambainis
, Satyanarayana V. Lokam
·
Lecture notes in computer science
·
17
The Capacity of the Kanerva Associative Memory is Exponential
1987
·
Philip A. Chou
·
neural information processing systems
·
16
Finding the ?n-th largest element
1996
·
Dorit Dor
, Uri Zwick
·
COMBINATORICA
·
15
On the fractional weight of distinct binaryn-tuples (Corresp.)
1974
·
J. Massey
·
IEEE Transactions on Information Theory
·
15
An achievable bound for optimal noiseless coding of a random variable (Corresp.)
1986
·
E. Verriest
·
IEEE Transactions on Information Theory
·
14
On the Structure of Additive Quantum Codes and the Existence of Nonadditive Codes
1997
·
Roychowdhury, Vwani P.
, Vatan, Farrokh
·
arXiv (Cornell University)
·
13
PDF
An Improved Algorithm for Code Equivalence
2025
·
Julian Nowakowski
·
Lecture notes in computer science
·
12
On the Existence of Nonadditive Quantum Codes
1999
·
Vwani P. Roychowdhury
, Farrokh Vatan
·
Lecture notes in computer science
·
12
On the capacity region of the discrete additive multiple-access arbitrarily varying channel
1992
·
J.A. Gubner
·
IEEE Transactions on Information Theory
·
12
PDF
Resolution of the Detection Threshold Conjecture for Random Geometric Graphs in the $d>n$ Regime
2026
·
Du, Hang
, Mao, Cheng
, et al.
·
arXiv (Cornell University)
·
11
PDF
On the capacity of the binary adversarial wiretap channel
2016
·
Carol Wang
·
Allerton Conference on Communication, Control, and Computing
·
11
PDF
On the average delay for routing subject to independent deflections
1993
·
B. Hajek
, R.L. Cruz
·
IEEE Transactions on Information Theory
·
11
Show more works
View as search
Works count:
101
Citation count:
4,376
Year
Topic
Type