#### Filter Results:

- Full text PDF available (13)

#### Publication Year

1962

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn 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 and SCOMP, which require stronger evidence to declare an item defective, and an essentially optimal but computationally difficult algorithm called SSS. We… (More)

- Matthew Aldridge
- 2012 IEEE International Symposium on Information…
- 2012

Group testing is the combinatorial problem of identifying the defective items in a population by grouping items into test pools. Recently, nonadaptive group testing - where all the test pools must be decided on at the start - has been studied from an information theory point of view. Using techniques from channel coding, upper and lower bounds have been… (More)

- Matthew Aldridge
- 2007

Objective ● Want to find and identify homogeneous patches in a 2D matrix, where:

- Matthew Aldridge
- ArXiv
- 2011

A central problem in the operation of large wireless networks is how to deal with interference -- the unwanted signals being sent by transmitters that a receiver is not interested in. This thesis looks at ways of combating such interference. In Chapters 1 and 2, we outline the necessary information and communication theory background, including the concept… (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 group testing we prove an information-theoretic lower bound which tightens a bound of Chan et al. This can be combined with a performance analysis of a version… (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 communication across a pair of fading matrices. However, it comes with the overhead of a long time delay until matchable matrices occur: the delay is q<sup>n2</sup>… (More)

- Oliver Johnson, Matthew Aldridge, Robert J. Piechocki
- IEEE Transactions on Information Theory
- 2011

We consider a dense K user Gaussian interference network formed by paired transmitters and receivers placed independently at random in a fixed spatial region. Under natural conditions on the node position distributions and signal attenuation, we prove convergence in probability of the average per-user capacity C<sub>Σ</sub>/K to 1/2E log(1 + 2SNR).… (More)

- Matthew Aldridge, Leonardo Baldassini, Karen Gunderson
- J. Comb. Optim.
- 2017

An m × n matrix A with column supports {Si} is k-separable if the disjunctions i∈K Si are all distinct over all sets K of cardinality k. While a simple counting bound shows that m > k log 2 n/k rows are required for a separable matrix to exist, in fact it is necessary for m to be about a factor of k more than this. In this paper, we consider a weaker… (More)

- Matthew Aldridge, Oliver Johnson, Robert J. Piechocki
- 2010 IEEE International Symposium on Information…
- 2010

We consider a dense n-user Gaussian interference network formed by paired transmitters and receivers placed independently at random in Euclidean space. Under natural conditions on the node position distributions and signal attenuation, we prove convergence in probability of the average per-user capacity CΣ/n to  E log(1 + 2SNR). The… (More)

- Matthew Aldridge
- ArXiv
- 2015

—We consider nonadaptive group testing with Bernoulli tests, where each item is placed in each test independently with some fixed probability. We give a tight threshold on the maximum number of tests required to find the defective set under optimal Bernoulli testing. Achievability is given by a result of Scarlett and Cevher; here we give a converse bound… (More)