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.

saffron (crocus sativus l.) is an indigenous and the most valuable and marginal plant in iran. however, limited knowledge exists on its molecular biology. the importance of this plant is due to the color, flavor and medicinal properties of its red stigmas. saffron stigmas contain a high amount of carotenoids such as crocetin and crocin. two genes, bch and pds, have essential role in carotenoid ...

We show that the standard decoding algorithm for BCH codes can be modified to run in time polynomial in the length of the syndrome. This works for BCH codes over any field GF (q), which include Hamming codes in the binary case and Reed-Solomon for the case n = q − 1. BCH codes are handled in detail in many textbooks (e.g., [vL92]); our presentation here is quite terse. For simplicity, we only d...