Skip to search formSkip to main contentSkip to account menu

Binary entropy function

Known as: Bernoulli entropy, Binary entropy 
In information theory, the binary entropy function, denoted or , is defined as the entropy of a Bernoulli process with probability of success… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Binary logarithmBinary symmetric channelFano's inequalityFuzzy extractor

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Fundamental Limits on Delivery Time in Cloud- and Cache-Aided Heterogeneous Networks
A Fog radio access network is considered as a network architecture candidate to meet the soaring demand in terms of reliability… 
2016
2016
Timing Channel: Achievable Rate in the Finite Block-Length Regime
The exponential server timing channel is known to be the simplest, and in some sense canonical, queuing timing channel. The… 
2012
2012
New feature extraction algorithm for satellite image non-linear small objects
For satellite image non-linear small objects, a new feature extraction algorithm is proposed. This algorithm extracts features in… 
2007
2007
Sensing Capacity of Sensor Networks : Fundamental Tradeoffs of SNR , Sparsity and Sensing Diversity
A fundamental question in sensor networks is to determine the sensing capacity – the minimum number of sensors necessary to… 
2005
2005
Code Optimization for Lossless Turbo Source Coding
A novel source coding scheme based on turbo codes was presented in [1]. Lossless data compression is thereby achieved by… 
2001
2001
Memory-Efficient Recursive Interleaved Entropy Coding
Recursive interleaved entropy coding is a promising new adaptable binary entropy coding technique that offers fast encoding and… 
2000
2000
On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived… 
1987
1987
Some families of zero- error block codes for the two-user binary adder channel with feedback
Families of zero-error codes for the real binary adder channel with feedback that achieve high rate pairs are introduced. Two… 
1985
1985
On the complete decoding of binary linear codes
Complete decoding of systematic linear block codes by standard arrays with coset leaders not necessarily of minimal weight gives… 
1974
1974
On the fractional weight of distinct binary n -tuples (Corresp.)
It is shown that the fraction p of ones in the Mn positions of M distinct binary n-tuples satisfies a given inequality. This… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)