In this paper, we evaluate the performance of an adaptive error correction scheme for Wireless ATM Networks (WATM). This scheme attempts to minimize the system throughput in order to satisfy the user defined Quality of Service (QoS) constraints. Indeed, error control for high speed wireless ATM networks is an important research topic even wireless communication channels are highly affected by u...

This paper focuses on the estimation of statistical atlases of 3D images by means of diffeomorphic transformations. Within a Log-Euclidean framework, the exponential and logarithm maps of diffeomorphisms need to be computed. In this framework, the Inverse Scaling and Squaring (ISS) method has been recently extended for the computation of the logarithm map, which is one of the most time demandin...

The structure of the twisted squaring construction, a generalization of the squaring construction, is studied with respect to trellis diagrams and complexity. We show that binary affine-invariant codes, which include the extended primitive BCH codes, and the extended binary quadratic-residue codes, are equivalent to twisted squaring construction codes. In particular, a recursive symmetric rever...

Our paper presents the prototyping of a BCH (Bose, Chaudhuri, and Hocquenghem) encoder and decoder using a Field Programmable Gate Array (FPGA) reconfigurable chip. The solutions implemented on FPGA lead to a high calculation rate using parallelization. We implemented the BCH code in a 3s400FG456 FPGA. In this implementation we used 15 bit-size word code and the results show that the circuits w...

The watermark signals are weakly inserted in images due to imperceptibility constraints which makes them prone to errors in the extraction stage. Although the error correcting codes can potentially improve their performance one must pay attention to the fact that the watermarking channel is in general very noisy. We have considered the trade-o of the BCH codes and repetition codes in various co...

This paper considers Bose-Chaudhuri-Hocquenghem (BCH) codes for distributed source coding. A feedback channel is employed to adapt the rate of the code during the decoding process. The focus is on codes with short block lengths for independently coding a binary source X and decoding it given its correlated side information Y. The proposed codes have been analyzed in a high-correlation scenario,...

Absfruct-Goppa described a new class of linear noncyclic errorcorrecting codes in [l] and [2]. This paper is a summary of Goppa’s work, which is not yet available in English.’ We prove the four most important properties of Goppa codes. 1) There exist q-ary Goppa codes with lengths and redundancies comparable to BCH codes. For the same redundancy, the Goppa code is typically one digit longer. 2)...

A four-year project to build capacity in developing and transition countries to participate effectively in the Biosafety Clearing-House (BCH) has resulted in a well-trained and effective team of BCH Regional Advisors, an extensive and continually improving body of training materials, and a growing number of participating countries. Throughout the project, the training and the materials have inc...

Motivated by the problem of nding light (i.e., low weight) and short (i.e., low degree) codewords in narrow-sense, primitive BCH codes we consider the problem of determining the probability that a random t-set of vectors in an n dimensional vector space over GF (q) contains an r-dimensional subspace (or aane subspace). We nd some bounds for this and similar probabilities and apply these techniq...

| BCH decoding usually involves the evaluation of the error-locator polynomial. This is often achieved with the Berlekamp-Massey algorithm. The evaluation of the error-locator polynomial may also be computed using fast inversion techniques for Hankel matrices. It can be shown that O(lt) steps are necessary, with l being the number of errors which occurred and t being the error-correction capabi...