#### Filter Results:

- Full text PDF available (38)

#### Publication Year

2000

2018

- This year (4)
- Last 5 years (29)
- Last 10 years (50)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Dino Sejdinovic, Oliver Johnson
- 2010 48th Annual Allerton Conference onâ€¦
- 2010

An information theoretic perspective on group testing problems has recently been proposed by Atia and Saligrama, in order to characterise the optimal number of tests. Their results hold in theâ€¦ (More)

- Ioannis Kontoyiannis, Peter HarremoÃ«s, Oliver Johnson
- IEEE Transactions on Information Theory
- 2005

Two new information-theoretic methods are introduced for establishing Poisson approximation inequalities. First, using only elementary information-theoretic techniques it is shown that, when S/subâ€¦ (More)

- Oliver Johnson
- 2008

We prove that the Poisson distribution maximises entropy in the class of ultralog-concave distributions, extending a result of HarremoÃ«s. The proof uses ideas concerning log-concavity, and aâ€¦ (More)

- Matthew Aldridge, Leonardo Baldassini, Oliver Johnson
- IEEE Transactions on Information Theory
- 2014

We consider the problem of nonadaptive noiseless group testing of N items of which K are defective. We describe four detection algorithms, the COMP algorithm of Chan et al., two new algorithms, DDâ€¦ (More)

English abstract: We consider the Student-t and Student-r distributions, which maximise RÃ©nyi entropy under a covariance condition. We show that they have information-theoretic properties whichâ€¦ (More)

- Yaming Yu, Oliver Johnson
- 2009 IEEE International Symposium on Informationâ€¦
- 2009

Building on the recent work of Johnson (2007) and Yu (2008), we prove that entropy is a concave function with respect to the thinning operation T<inf>Î±</inf>. That is, if X and Y are independentâ€¦ (More)

- Oliver Johnson, Matthew Aldridge, Robert J. Piechocki
- 2012 IEEE International Symposium on Informationâ€¦
- 2012

Ergodic interference alignment, as introduced by Nazer et al (NGJV), is a technique that allows high-rate communication in n-user interference networks with fast fading. It works by splittingâ€¦ (More)

- Oliver Johnson, Yaming Yu
- IEEE Transactions on Information Theory
- 2010

We consider the entropy of sums of independent discrete random variables, in analogy with Shannon's Entropy Power Inequality, where equality holds for normals. In our case, infinite divisibilityâ€¦ (More)

- Leonardo Baldassini, Oliver Johnson, Matthew Aldridge
- 2013 IEEE International Symposium on Informationâ€¦
- 2013

We define capacity for group testing problems and deduce bounds for the capacity of a variety of noisy models, based on the capacity of equivalent noisy communication channels. For noiseless adaptiveâ€¦ (More)

- Peter HarremoÃ«s, Oliver Johnson, Ioannis Kontoyiannis
- 2007 IEEE International Symposium on Informationâ€¦
- 2007

The "thinning" operation on a discrete random variable is the natural discrete analog of scaling a continuous variable, i.e., multiplying it by a constant. We examine the role and properties ofâ€¦ (More)