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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

A Fog radio access network is considered as a network architecture candidate to meet the soaring demand in terms of reliability…

2016

The exponential server timing channel is known to be the simplest, and in some sense canonical, queuing timing channel. The…

2014

Large scale image classification requires efficient scalable learning methods with linear complexity in the number of samples…

2012

Malware analysis process is being categorized into static analysis and dynamic analysis. Both static and dynamic analysis have…

2008

This paper proposes a new noise-robust lossless compression algorithm, for binary memoryless sources, based on a decremental…

2002

The lossless codication of stationary memoryless binary sources using block coding is studied with the additional constraint of…

2001

In this paper, we study the problem of sending an n-bit binary string drawn from a probability distribution D across a…

1998

In this paper we examine the problem of sending an n-bit data item from a client to a server across an asymmetric communication…

1987

Families of zero-error codes for the real binary adder channel with feedback that achieve high rate pairs are introduced. Two…

1985

Complete decoding of systematic linear block codes by standard arrays with coset leaders not necessarily of minimal weight gives…