Simulating a crowded scene like a busy shopping street requires tight packing of virtual characters. In such cases collisions are likely to occur, and the choice in collision detection shape will influence how characters are allowed to intermingle. Full collision detection is too expensive for crowds, so simplifications are needed. The most common simplification, the fixed-width, pose-independe...

OBJECTIVES To assess community perceptions of mental illness in the Bwindi Community Hospital (BCH) catchment area: to recognise beliefs about the causes and the treatments for mental illness. To provide community data to staff at BCH as they work to develop more effective community mental health programmes. BACKGROUND A shortage of mental health providers in Uganda has prompted research into...

Distributed source coding, separate encoding (compression) and joint decoding of statistically dependent sources, arises in an increasing number of applications like sensor networks and multiview video coding. Many of those applications are highly interactive, requiring the development of low-delay, energy-limited communication and computing schemes. Currently, this compression is performed by ...

The notions of N-subalgebras and N-closed ideals in BCH-algebras are introduced, and the relation between N-subalgebras and N-closed ideals is considered. Characterizations of Nsubalgebras andN-closed ideals are provided. Using special subsets,N-subalgebras andN-closed ideals are constructed. A condition for anN-subalgebra to be anN-closed ideal is discussed. Given an N-structure, the greatestN...

In this paper, we study the structure of 1-generator quasi-cyclic codes over the ring R = F2 +uF2 + vF2 + uvF2, with u2 = v2 = 0 and uv = vu. We determine the minimal spanning sets for these codes. As a generalization of these codes, we also investigate the structure of 1-generator generalized quasi-cyclic codes over R and determine a BCH type bound for them.

Article history: Received 26 March 2009 Available online 23 October 2010 Communicated by Efim Zelmanov MSC: 16E05 16E10

New lower bounds on the minimum length of terror correcting BCH codes with covering radius at most 2t are derived.

We classify the permutation groups of cyclic codes over a finite field. As a special case, we find the permutation groups of non-primitive BCH codes of prime length. In addition, the Sylow p-subgroup of the permutation group is given for many cyclic codes of length p. Several examples are given to illustrate the results.

A novel method of spectral decoding for systematic BCH codes has been proposed. This a simple description and small computational complexity.