#### Filter Results:

#### Publication Year

2004

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

#### Organism

Learn More

Many free-ranging predators have to make foraging decisions with little, if any, knowledge of present resource distribution and availability. The optimal search strategy they should use to maximize encounter rates with prey in heterogeneous natural environments remains a largely unresolved issue in ecology. Lévy walks are specialized random walks giving… (More)

- C. Tjhai, M. Tomlinson, R. Horan, M. Ahmed, M. Ambroze
- 2008

This paper presents a more efficient algorithm to count codewords of given weights in self-dual double-circulant and formally self-dual quadratic double-circulant codes over GF(2). A method of deducing the modular congruence of the weight distributions of the binary quadratic double-circulant codes is proposed. This method is based on that proposed by… (More)

The decisions animals make about how long to wait between activities can determine the success of diverse behaviours such as foraging, group formation or risk avoidance. Remarkably, for diverse animal species, including humans, spontaneous patterns of waiting times show random 'burstiness' that appears scale-invariant across a broad set of scales. However,… (More)

We show how to construct an algorithm to search for binary idempotents which may be used to construct binary LDPC codes. The algorithm, which allows control of the key properties of sparseness, code rate and minimum distance, is constructed in the Mattson-Solomon domain. Some of the new codes, found by using this technique, are displayed.

The Hamming weight enumerator function of the formally self-dual even, binary extended quadratic residue code of prime p = 8m + 1 is given by Gleason's theorem for singly-even code. Using this theorem, the Hamming weight distribution of the extended quadratic residue is completely determined once the number of codewords of Hamming weight j Aj, for 0 ≤ j ≤… (More)

— This paper investigates decoding of binary linear block codes over the binary erasure channel (BEC). Of the current iterative decoding algorithms on this channel, we review the Recovery Algorithm and the Guess Algorithm. We then present a Multi-Guess Algorithm extended from the Guess Algorithm and a new algorithm – the In-place Algorithm. The Multi-Guess… (More)

—In this paper, we consider the primary user detection problem in cognitive radio systems by using multi antenna at the cognitive radio receiver. An optimal linear combiner multi antenna based spectrum sensing technique is proposed using the multitaper spectrum estimation method. A suboptimal square law combiner multi antenna based technique, using the… (More)

— Based on the ideas of cyclotomic cosets, idempotents and Mattson-Solomon polynomials, we present a new method to construct GF(2 m), where m > 0 cyclic low-density parity-check codes. The construction method produces the dual code idempotent which is used to define the parity-check matrix of the low-density parity-check code. An interesting feature of this… (More)

- P. Shah, M. Ahmed, M. Ambroze, C. Tjhai, P. J. Davey
- 2006

— This paper investigates the use of multi-level modulation for magnetic recording using a novel Soft-Feedback Equalisation (SFE) approach. Different aspects of investigation are: 1) Multilevel Recording, 2) SFE and 3) Application of Turbo Codes. The SFE scheme is a model in which the partial response (PR) equaliser and Maximum A Posteriori (MAP) decoder… (More)

— An algorithm of improving the performance of iterative decoding on perpendicular magnetic recording is presented. This algorithm follows on the authors' previous works on the parallel and serial concatenated turbo codes and low-density parity-check codes. The application of this algorithm with signal-to-noise ratio mismatch technique shows promising… (More)