Using a new parity-check matrix, a class of convolutional codes with a designed free distance is introduced. This new class of codes has many characteristics of BCH block codes, therefore, we call these codes BCH convolutional codes.

This study suggests a novel watermarking technique that uses artificial neural networks (ANN) and BCH (Bose, Chaudhuri and Hocquenghem) coding together to protect intellectual property rights of a color image. BCH error correction coding method is used to improve the performance of watermark extracting. With this composed technique, image is divided into sub-blocks, and a bit-sequence which is ...

Using a new parity-check matrix, a class of convolutional codes with a designed free distance is introduced. This new class of codes has many characteristics of BCH block codes, therefore, we call these codes BCH convolutional codes.

This paper investigates the potential of using strong BCH codes to improve multilevel data-storage NAND Flash memory capacity. Current multilevel Flash memories store 2 bits in each cell. Further storage capacity may be achieved by increasing the number of storage levels per cell, which nevertheless will largely degrade the raw storage reliability. Based on a Gaussian-like memory cell threshold...

BCH codes are widely employed in data storage, communications systems, and consumer electronics. A new application of LCD codes in cryptography was found recently. It is known that LCD codes are asymptotically good. LCD cyclic codes were referred to as reversible cyclic codes in the literature. The objective of this paper is to construct a class of LCD codes, which are also BCH codes. The dimen...

Using the characterization of the idempotents of a narrow-sense primitive binary BCH code, we are able to give classes of such codes whose minimum distance reaches the BCH bound. Let be a primitive element of GF(2 m). We denote R n = GF(2))x]=(x n ? 1), n = 2 m ? 1. 1 Binary BCH codes and locator polynomials 1.1 Primitive binary BCH codes For our purpose we only need to deene a particular class...

An ensemble of symbolic, numeric and graphic computations developed to construct the Octonionic and compact G2 structures in Mathematica 8.0. Cayley-Dickenson Construction symbolically applied from Reals to Octonions. Baker– Campbell–Hausdorff formula (BCH) in bracket form verified for Octonions. Algorithms for both exponentiation and logarithm of Octonions developed. Exclusive validity of vect...