 Research
 Open Access
 Published:
An association between primitive and nonprimitive BCH codes using monoid rings
EURASIP Journal on Wireless Communications and Networking volume 2016, Article number: 38 (2016)
Abstract
BCH codes are one of the most important classes of cyclic codes for error correction. In this study, we generalize BCH codes using monoid rings instead of a polynomial ring over the binary field F _{2}. We show the existence of a nonprimitive binary BCH code C _{ bn } of length bn, corresponding to a given length n binary BCH code C _{ n }. The value of b is investigated for which the existence of the nonprimitive BCH code C _{ bn } is assured. It is noticed that the code C _{ n } is embedded in the code C _{ bn }. Therefore, encoding and decoding of the codes C _{ n } and C _{ bn } can be done simultaneously. The data transmitted by C _{ n } can also be transmitted by C _{ bn }. The BCH code C _{ bn } has better error correction capability whereas the BCH code C _{ n } has better code rate, hence both gains can be achieved at the same time.
Introduction
The BCH codes form a large class of errorcorrecting cyclic codes that are constructed using finite fields. One of the key features of BCH codes is that during code design, there is a precise control over the number of symbol errors correctable by the code. In particular, it is possible to design binary BCH codes that can correct multiple bit errors. Another advantage of BCH codes is the ease with which they can be decoded, namely, via an algebraic method known as syndrome decoding. This simplifies the design of the decoder for these codes using small lowpower electronic hardware.
Cyclic codes were initially considered by Prange (see [1, 2]). After him progress in the theory of cyclic codes for random as well as bursterror correction has been motivated by many coding theorists. The correspondence of cyclic codes with ideals was observed independently by Peterson [3], and Kasami [4]. Though most of the conventional errorcorrecting codes are principal ideals in the factor ring of a polynomial ring in one indeterminate. In [5], instead of one indeterminate, the authors have given the necessary and sufficient conditions for an ideal to have a single generator while, in [6], they have described all finite commutative principal ideal rings \(\frac {{\mathbb {Z}}_{\text {m}}[x_{1}, \cdots, {x}_{n}]}{J}\), where J is an ideal generated by univariate polynomials.
The extension of a BCH code embedded in a semigroup ring is considered in [7]. A great amount of information regarding rings construction and its corresponding polynomial codes is given in [8]. In [8], Sections 9.1 and 9.2 are devoted to error correcting codes in ring construction closely related to semigroup rings. Particularly, Section 9.1 deals with errorcorrecting cyclic codes of length l which are in fact the ideals in the group ring F[ G], where F is a field and G is a finite torsion group of order l. However, in [9] and [10], the authors have mentioned about extensions of BCH codes in many ring constructions, where the outcomes can be considered as the special case of semigroup rings.
Through monoid rings, in a sequence of papers [11–17], several classes of cyclic codes over a finite unitary commutative ring are constructed. The purpose of these constructions is to address the error correction and the code rate trade off in a smart way. However, for a particular interest in [18], it is established that, there does not exist a binary BCH code of length (n+1)n in the factor ring \(F_{2}\left [x;\frac {1}{2} \mathbb {Z}_{\geq 0}\right ]/\left (\left (x^{\frac {1}{2}}\right)^{(n+1)n}1\right)\) generated by generalized polynomial \(g\left (x^{\frac {1}{2}}\right)\in F_{2}\left [x;\frac {1}{2} \mathbb {Z}_{\geq 0}\right ]\) of degree 2r corresponding to the length n binary BCH code in F _{2}[ x]/(x ^{n}−1) having generator polynomial g(x)∈ F _{2}[ x] of degree r. But, there does exist a binary cyclic code of length (n+1)n such that the length n binary BCH code is embedded in it. Besides this, the existence of a binary cyclic \(\left ((n+1)^{3^{k}}1,(n+1)^{3^{k}}13^{k}r\right)\) code, where k is a positive integer, corresponding to a binary cyclic (n,n−r) code is established in [15] by the use of monoid ring \(F_{2}\left [x;\frac {1}{3^{k}}\mathbb {Z}_{\geq 0}\right ]\).
In both papers [18] and [15], the authors cannot show the existence of binary BCH codes corresponding to the length n binary BCH code in F _{2}[ x]/(x ^{n}−1). In this study, we address this issue and construct a binary BCH code using monoid ring \(F_{2}\!\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ],\) where a,b are integers such that a,b>1. We show the existence of nonprimitive binary BCH code C _{ bn } of length bn using an irreducible polynomial \(p\left (x^{\frac {a}{b}}\right)\in F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]\) of degree br, corresponding to a given length n binary BCH code C _{ n } generated by r degree primitive polynomial p(x ^{a}) in \( F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ].\) It is noticed that the binary BCH code C _{ n } is embedded in nonprimitive BCH code C _{ bn }. In this way a link between a primitive and nonprimitive BCH code is attained. The length of the binary BCH C _{ bn } is well controlled and has better error correction capability as compared to the length (n+1)n binary cyclic code C _{(n+1)n } initiated in [18].
This paper is organized in the following way: Section 2 contains a brief introduction to the monoid rings and a description of binary BCH codes as ideals in the factor ring \(F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]_{n}=F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]/\left ((x^{a})^{n}1\right)\), a case parallel to Ham (r,2). Section 3 gives the construction technique of a nonprimitive BCH code C _{ bn } of length bn in the factor ring \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]_{\textit {bn}}=F_{2}\left [x;\frac {a}{b} \mathbb {Z}_{\geq 0}\right ]/\left (\left (x^{\frac {a}{b}}\right)^{bn}1\right)\), corresponding to a given length n primitive BCH code C _{ n } obtained in Section 2. Moreover, a link has been established between the binary BCH codes C _{ n } and C _{ bn }. In Section 4, decoding of the binary BCH code C _{ n } through the decoding of binary BCH code C _{ bn } is explained. Section 5 concludes the study.
BCH code C _{ n } as ideal in \(F_{2}[\!x;a\mathbb {Z}_{\geq 0}]/((x^{a})^{n}1)\)
Let (S,∗) be a commutative monoid and F _{2} be the binary field. The set of all finitely nonzero functions f from S into F _{2} is denoted by F _{2}[ S]. The set F _{2}[ S] is a ring with respect to binary operations addition and multiplication defined as: (f+g)(s)=f(s)+g(s) and \( (\,fg)(s)=\sum \limits _{t\ast u=s}f(t)g(u),\) where the symbol \( \sum \limits _{t\ast u=s}\) indicates that the sum is taken over all pairs (t,u) of elements of S such that t∗u=s, and it is understood that in the situation where s is not expressible in the form t∗u for any t,u∈S, then (f g)(s)=0. F _{2}[ S] is known as the monoid ring of S over F _{2}. The representation of F _{2}[ S] will be F _{2}[ x;S] whenever S is an additive monoid. As there is an isomorphism between additive semigroup S and multiplicative semigroup {x ^{s}:s∈S}, so a nonzero element f of F _{2}[ x;S] is uniquely represented in the canonical form \(\sum \limits _{i=1}^{n}f(s_{i})x^{s_{i}}=\sum \limits _{i=1}^{n}f_{i}x^{s_{i}}\), where f _{ i }≠0 and s _{ i }≠s _{ j } for i≠j. Of course, the monoid ring F _{2}[ x;S] is a polynomial ring in one indeterminate if \(S=\mathbb {Z}_{\geq 0}\) (the set of nonnegative integers).
The concept of degree and order are not generally defined in monoid rings. However, if we consider S to be a totally ordered monoid, we can define degree and order of an element of monoid ring F _{2}[ x;S] in the following manner: if \(f=\sum \limits _{i=1}^{n}f_{i}x^{s_{i}}\) is the canonical form of the nonzero element f∈F _{2}[ x;S], where s _{1}<s _{2}<…<s _{ n }, then s _{ n } is called the degree of f written as deg(f)=s _{ n } and s _{1} is the order of f written as o r d(f)=s _{1}.
A polynomial ring F _{2}[x] is initially a monoid ring F _{2}[ x;S], where S is an additive monoid \(\mathbf {\mathbb {Z}}_{\geq 0}\). It can be observed that \(F_{2}[\!x]\subset F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]\) only when a=1. This forces us to first define cyclic codes using monoid ring \(F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]\) and then define cyclic codes using monoid ring \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ].\) As \(F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]\subset F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ],\) also \(F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]\subset F_{2}[\!x]\) for all a≥1. Where both the monoids \(a\mathbb {Z}_{\geq 0}\) and \(\frac {a}{b}\mathbb {Z}_{\geq 0}\) are totally ordered, so degree and order of elements in \(F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]\) and \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]\) are defined. The indeterminate of polynomials in monoid rings \( F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]\) and \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]\) are respectively given by x ^{a} and \(x^{\frac {a}{b}},\) and they behave like an indeterminate x in F _{2}[ x]. The arbitrary elements in \(F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]\) and \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]\) are f(x ^{a})=1+(x ^{a})+(x ^{a})^{2}+…(x ^{a})^{n} and \(f\left (x^{\frac {a}{b}}\right)=1+\left (x^{\frac {a}{b}}\right)+\left (x^{\frac {a}{b}}\right)^{2}+\ldots \left (x^{\frac {a}{b}}\right)^{n}\) and we call them generalized polynomials.
The construction of a BCH code in the factor ring \(F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]_{n}\) is similar to that of a BCH code in F _{2}[ x]_{ n }, as \( F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]\subset F_{2}[\!x].\) For this, let C _{ n } be a binary BCH code based on the positive integers c,d,q=2 and n such that 2≤d≤n with g c d(n,2)=1 and n=2^{s}−1, where s is the degree of a primitive polynomial in \(F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]\). Consequently, the length n binary BCH code C _{ n } has generator polynomial of degree r given by g(x ^{a})=l c m{m _{ i }(x ^{a}):i=c,c+1,…,c+d−2}, where m _{ i }(x ^{a}) are minimal polynomials of ξ ^{i} for i=c,c+1,…,c+d−2. Where ξ is the primitive nth root of unity in \(\phantom {\dot {i}\!}F_{2^{s}},\) an s degree Galois field extension of F _{2}. Since m _{ i }(x ^{a}) divides (x ^{a})^{n}−1 for each i, it follows that g(x ^{a}) divides (x ^{a})^{n}−1. This implies C _{ n }=(g(x ^{a})) is a principal ideal in the factor ring \(F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]_{n}\).
In the following example, primitive BCH code of length 15 is discussed using monoid ring \(F_{2}\left [x;2\mathbb {Z}_{\geq 0}\right ]\).
Example 1.
Let p(x ^{2})=(x ^{2})^{4}+(x ^{2})+1 be a primitive polynomial in \(F_{2}\left [x;2\mathbb {Z}_{0}\right ],\) then we have a primitive BCH code of length n=2^{4}−1=15. Let ξ be a primitive root in G F(2^{4}), satisfying the relation ξ ^{4}+ξ+1=0. Using this relation we have ξ ^{15}=1, that is ξ is the primitive 15^{th} root of unity. Since g(x ^{2})=lcm{m _{ i }(x ^{2}),i=c,c+1,…,c+d−2}; therefore, first we calculate m _{ i }(x ^{2}). By ([19], Theorem 4.4.2), ξ,ξ ^{2},ξ ^{4},ξ ^{8} have same minimal polynomial m _{1}(x ^{2})=p(x ^{2}). Similarly we get m _{3}(x ^{2})=(x ^{2})^{4}+(x ^{2})^{3}+(x ^{2})^{2}+(x ^{2})+1,m _{5}(x ^{2})=(x ^{2})^{2}+(x ^{2})+1 and m _{7}(x ^{2})=(x ^{2})^{4}+(x ^{2})^{3}+1.
The BCH code with designed distance d=3 has generator polynomial g(x ^{2})=m _{1}(x ^{2})=(x ^{2})^{4}+(x ^{2})+1. It has a minimum distance of at least 3 and corrects up to 1 error. Since the generator polynomial is of degree 4, it is therefore a (15,11) code having code rate R=0.733. BCH codes of length 15 with different design distances are discussed in Table 1.
BCH codes as ideals in \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]_{\textit {bn}}\)
In this section, we investigate the values of b for which there exists a BCH code of length bn in \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]_{\textit {bn}},\) corresponding to a length n binary BCH code C _{ n } in \( F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]_{n}.\) For this, let C _{ n } be a binary BCH code in \(F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]_{n}\) constructed in previous section. Now using the following map \(p\left (x^{a}\right)=p_{0}+p_{1}x^{a}+\ldots +p_{n1}\left (x^{a}\right)^{n1}\mapsto p_{0}+p_{1}\left (x^{\frac {a}{b}}\right)^{b}+\ldots +p_{n1}\left (x^{\frac {a}{b}}\right)^{b(n1)}=p\left (x^{ \frac {a}{b}}\right),\) we convert the s degree primitive polynomial p(x ^{a}) in \(F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]\) to a bs degree polynomial \(p\left (x^{\frac {a}{b}}\right)\) in \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ].\) This converted polynomial is never primitive; therefore, the corresponding BCH code will also be nonprimitive. However, the nonprimitive BCH code can be constructed only when \(p\left (x^{\frac {a}{b}}\right)\) is irreducible. Hence, for the construction of a nonprimitive BCH code in \( F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]_{\textit {bn}}\), we choose only such a primitive irreducible polynomial p(x ^{a}) in \(F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]\) for which there is an irreducible polynomial \(p\left (x^{\frac {a}{b}}\right)\) in \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ].\)
Particularly for b=2 or 2l, there neither exists a primitive BCH code nor a nonprimitive BCH code, since we know that p(x ^{2})=(p(x))^{2} in F _{2}[x], the same result holds in \(F_{2}\left [x;\frac {a}{2}\mathbb {Z}_{\geq 0}\right ].\) Similarly, for s=5,7,11,13,17,… and there multiples we do not find any b for which we have an irreducible polynomial in \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]\).
For instance, see Table 2 for the list of irreducible polynomials of degree b s in \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]\) corresponding to primitive irreducible polynomial of degree s in \(F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]\).
Table 2 explains that for s=2 and 3 we have b=3 and 7 and for s=4 and 6 we have b=(3,5) and (3,7), respectively, and similarly we have for their multiples. From this, we have the list of BCH codes of length n and b n, where bn divides 2^{bs}−1, mentioned in Table 3.
The above discussion can be summed up with the following result.
Proposition 2.
Let \(p\left (x^{a}\right)\in F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]\) be a primitive irreducible polynomial of degree s ∈{2l,3l,4l,6l}, where \(l\in \mathbb {Z}^{+}.\) Then the corresponding bs degree generalized polynomial \(p\left (x^{\frac {a}{b}}\right)\) in \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]\) is nonprimitive irreducible polynomial for b∈ {3,7,{3,5},{3,7}}, respectively.
Proof.
Let p(x ^{a})=1+x ^{a}+…+(x ^{a})^{s} be a primitive irreducible polynomial in \(F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ],\) where s∈{2l,3l,4l,6l}, where \(l\in \mathbb {Z}^{+}\) such that α is its root and \(\alpha ^{2^{s}1}=1.\) Then the corresponding generalized polynomial \(p\left (x^{\frac {a}{b}}\right)=1+\left (x^{\frac {a}{b}}\right)^{b}+\ldots +\left (x^{\frac {a}{b}}\right)^{bs}\) in \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]\) has root \(\beta =(p_{\textit {si}})^{M}\in F_{2}^{bs},\) where p _{ si } is a primitive element in \(F_{2}^{bs}\) and M is a positive integer such that M(b(2^{s}−1))=2^{bs}−1. This implies \(\beta ^{b(2^{s}1)}=1\). Hence \(p\left (x^{\frac {a}{b}}\right)\) is not primitive. But, \(p\left (x^{\frac {a}{b}}\right)\) is irreducible over F _{2} for b∈{3,7,{3,5},{3,7}}, respectively by ([20], Theorem 5.1 and Example 5.4) where the indeterminate \(x^{\frac {a}{b}}\) behaves as indeterminate x.
Theorem 3.
Let n=2^{s}−1 be the length of primitive BCH code C _{ n }, where \(p\left (x^{a}\right)\in F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]\) is a primitive irreducible polynomial of degree s such that \( p\left (x^{\frac {a}{b}}\right)\in F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]\) is irreducible polynomial of degree b s.

1)
Then, for positive integers c ^{′},d ^{′},b n such that 2≤d ^{′}≤b n and bn is relatively prime to 2, there exists a nonprimitive binary BCH code C _{ bn } of length b n, where bn is order of an element \(\phantom {\dot {i}\!}\alpha \in F_{2^{bs}}.\)

2)
The nonprimitive BCH code C _{ bn } of length bn is defined as
$$\begin{aligned} C_{bn}&=\{v\left(x^{\frac{a}{b}}\right)\in F_{2}\left[\!x;\frac{a}{b} \mathbb{Z} _{\geq 0}\right]_{bn}:v(\alpha^{i})=0\,\text{for all }\\ i&=c^{\prime },c^{\prime}+1,\ldots c^{\prime }+d^{\prime }2. \end{aligned} $$
Equivalently, C _{ bn } is the null space of the matrix
Proof.

1)
Since it is given that the bs degree polynomial \(p\left (x^{\frac {a}{b}}\right)\in F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]\) is not primitive, so the BCH code constructed through it is also not primitive. Hence the length of the code n≠2^{bs}−1. However, there is an element \(\phantom {\dot {i}\!}\alpha \in F_{2^{bs}}\) of order bn vanishing \(p\left (x^{\frac {a}{ b}}\right).\) Let \(m_{i}\left (x^{\frac {a}{b}}\right)\in F_{2}\left [x;\frac {a}{b} \mathbb {Z}_{0}\right ]\) denotes the minimal polynomial of α ^{i} and \(g\left (x^{\frac {a}{b} }\right)\) be the lcm of distinct polynomials among \(m_{i}\left (x^{\frac {a}{b}}\right),\) i=c ^{′},c ^{′}+1,…,c ^{′}+d ^{′}−2; that is,
$$g\left(x^{\frac{a}{b}}\right)=\text{lcm}\{m_{i}\left(x^{\frac{a}{b}}\right):i=c^{\prime },c^{\prime }+1,\ldots,c^{\prime }+d^{\prime }2\}. $$As \(m_{i}\left (x^{\frac {a}{b}}\right)\) divides \(\left (x^{\frac {a}{b}}\right)^{bn}1\) for each i, therefore \(g\left (x^{\frac {a}{b}}\right)\) also divides \(\left (x^{\frac {a}{b}}\right)^{bn}1.\) This implies that C _{ bn } is a principal ideal generated by \(g\left (x^{\frac {a}{b}}\right)\) in the factor ring \(F_{2}\left [x;\frac {a}{b} \mathbb {Z}_{\geq 0}\right ]_{\textit {bn}}.\) Hence, C _{ bn } is a nonprimitive BCH code of length bn over F _{2}with designed distance d ^{′}.

2)
Let \(v\left (x^{\frac {a}{b}}\right)\in C_{\textit {bn}},\) then \(v\left (x^{\frac {a}{b}}\right)=g\left (x^{\frac {a }{b}}\right)q\left (x^{\frac {a}{b}}\right)\) for some \(q\left (x^{\frac {a}{b}}\right)\in F_{2}\left [\!x;\frac {a}{b} \mathbb {Z}_{\geq 0}\right ],\) where \(g\left (x^{\frac {a}{b}}\right)\) is the generator polynomial of C _{ bn }. Hence, v(α ^{i})=0 for all i=c ^{′},c ^{′}+1,…c ^{′}+d ^{′}−2. Conversely, let \(v\left (x^{\frac {a}{b}}\right)\in F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]_{\textit {bn}}\) such that v(α ^{i})=0 for all i=c ^{′},c ^{′}+1,…c ^{′}+d ^{′}−2. Then \(m_{i}\left (x^{\frac {a}{b}}\right)\) divides \(v\left (x^{\frac {a}{b}}\right)\) for all i=c ^{′},c ^{′}+1,…c ^{′}+d ^{′}−2. Hence \(g\left (x^{\frac {a}{b}}\right)\) divides \(v\left (x^{\frac {a}{b}}\right)\), so \(v\left (x^{\frac {a}{b}}\right)\in C_{\textit {bn}}.\)
For the second part, let \(v\left (x^{\frac {a}{b}}\right)=v_{0}+v_{1}\left (x^{\frac {a}{b} }\right)+\ldots \) \( v_{bn1}\left (x^{\frac {a}{b}}\right)^{bn1}\in F_{2}\left [x;\frac {a}{b} \mathbb {Z}_{\geq 0}\right ]_{\textit {bn}}.\) Then, v(α ^{i})=0 for all i=c ^{′},c ^{′}+1,…c ^{′}+d ^{′}−2 if and only if H v ^{T}=0, where \( v=(v_{0},v_{1},\ldots v_{bn1})\in F_{2}^{bn}.\) This proves that C _{ bn } is the null space of H.
Remark 4.
Corresponding to the (n,k) BCH code C _{ n } with generator polynomial g(x ^{a})=p(x ^{a}) in \(F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ],\) we have a (b n,b k) BCH code C _{ bn } with generating polynomial \(g\left (x^{\frac {a}{b}}\right)=p\left (x^{\frac {a}{b}}\right)\) in \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ].\) This (b n,b k) BCH code C _{ bn } is an interleaved code of degree b, capable of correcting a single error burst of length b or less (see [21], Theorem 11.1).
The following example illustrates the construction of a nonprimitive BCH code of length bn through \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ].\)
Example 5.
For a primitive polynomial p(x ^{2})=1+(x ^{2})+(x ^{2})^{4} in \( F_{2}[\!x;2 \mathbb {Z}_{\geq 0}],\) there is a nonprimitive irreducible polynomial \(p\left (x^{\frac {2}{3}}\right)=1+\left (x^{\frac {2}{3}}\right)^{3}+\left (x^{\frac {2}{3}}\right)^{12}\) in \(F_{2}\left [x;\frac {2}{3}\mathbb {Z}_{\geq 0}\right ].\) Let \(\alpha \in F_{2^{12}},\phantom {\dot {i}\!}\) satisfies the relation α ^{12}+α ^{3}+1=0. Using this relation, we can compute all the distinct powers of α in G F(2^{12}), see Table 4 (it is clear that α has order 45). Here, we have b n=n ^{′}=3×15=45. To calculate the generating polynomial \(g\left (x^{\frac {2}{3}}\right)\), we first calculate the minimal polynomials which are : \(m_{1}^{\prime }\left (x^{\frac {2}{3}}\right)=\left (x^{\frac {2}{3}}\right)^{12}+\left (x^{\frac {2}{3}}\right)^{3}+1,\) \(m_{3}^{\prime }\left (x^{\frac {2}{3}}\right)=\left (x^{\frac {2}{3}}\right)^{4}+\left (x^{\frac {2}{3}}\right)+1,\) \(m_{5}^{\prime }\left (x^{\frac {2}{3}}\right)=\left (x^{\frac {2}{3}}\right)^{6}+\left (x^{\frac {2}{3}}\right)^{3}+1,\) \(m_{7}^{\prime }\left (x^{\frac {2}{3}}\right)=\left (x^{\frac {2}{3}}\right)^{12}+\left (x^{\frac {2}{3}}\right)^{9}+1,\) \(m_{9}^{\prime }\left (x^{\frac {2}{3}}\right)=\left (x^{\frac {2}{3}}\right)^{4}+\left (x^{\frac {2}{3}}\right)^{3}+\left (x^{\frac {2}{3}}\right)^{2}+ \left (x^{\frac {2}{3}}\right)+1,\) \(m_{15}^{\prime }\left (x^{\frac {2}{3}}\right)=\left (x^{\frac {2}{3}}\right)^{2}+\left (x^{\frac {2}{3}}\right)+1,\) \(m_{21}^{\prime }\left (x^{\frac {2}{3}}\right)=\left (x^{\frac {2}{3}}\right)^{4}+\left (x^{\frac {2}{3}}\right)^{3}+1.\)
Which gives the following generating polynomials of BCH codes of length 45 with design distance d ^{′}=3,5,7,9,15,21 and 45.
Which generates (45,33),(45,29),(45,23),(45,11), (45,7),(45,5) and (45,1) codes and corrects up to 1, 2, 3, 4, 7, 10, and 22 errors having code rate 0.733,0.644,0.511,0.244,0.155,0.11,0.022, respectively. Where the code (45,33) is also capable of correcting any single error burst of length 3 or less by Remark 4.
Table 5 gives comparison between minimum distance, code rate and error correction capability of codes C _{15}, C _{45} in \(F_{2}\left [x;2\mathbb {Z}_{\geq 0}\right ]\), \(F_{2}\left [x;\frac {2}{3}\mathbb {Z}_{\geq 0}\right ]\), respectively.
Now, we are in position to develop a link between a primitive (n,n−r) binary BCH code C _{ n } and a nonprimitive (b n,b n−r ^{′}) binary BCH code C _{ bn }, where r and r ^{′} are, respectively, the degrees of their generating polynomials g(x ^{a}) and \(g\left (x^{\frac {a}{b}}\right)\).
From Theorem 3(1), it follows that the generalized polynomial \(g\left (x^{\frac {a}{b}}\right)\in F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]\) divides \(\left (x^{\frac {a}{b}}\right)^{bn}1\) in \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]\). So, there is a nonprimitive BCH code C _{ bn } generated by \( g\left (x^{\frac {a}{b}}\right)\) in \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]_{\textit {bn}}\). By the same argument, as bn divides n ^{′}=2^{bs}−1, so \(\left (x^{\frac {a}{b}}\right)^{bn}1\) divides \(\left (x^{\frac {a}{b}}\right)^{n^{\prime }}1\) in \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ].\) It follows that \(\left (\left (x^{\frac {a}{b}}\right)^{n^{\prime }}1\right)\subset \left (\left (x^{\frac {a}{b}}\right)^{bn}1\right).\) Consequently, third isomorphism theorem for rings gives
Thus, there is embedding C _{ n } ↪ C _{ bn } \( \hookrightarrow C_{n^{\prime }}\) of codes, whereas C _{ n },C _{ bn }, and \( C_{n^{\prime }}\) are, respectively, primitive BCH, nonprimitive BCH and primitive BCH codes. Whereas the embedding C _{ n } ↪ C _{ bn } is defined as:
Where a(x ^{a})∈C _{ n } and \(a\left (x^{\frac {a}{b}}\right)\in C_{\textit {bn}}.\)
The above discussion shapes the following.
Theorem 6.
Let C _{ n } be a primitive binary BCH code of length n=2^{s}−1 generated by r degree polynomial g(x ^{a}) in \(F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ],\) then:

1)
There exists a bn length binary nonprimitive BCH code C _{ bn } generated by br degree polynomial \(g\left (x^{\frac {a}{b}}\right)\) in \(F_{2}\left [x;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ];\) and

2)
The binary primitive BCH code C _{ n } is embedded in the binary nonprimitive BCH code C _{ bn }.
Also, we can deduce g(x ^{a}) from \(g\left (x^{\frac {a}{b}}\right)\) by substituting x ^{a} for y ^{b}.
Example 7.
Following Examples 1 and 5:
The BCH codes with designed distance d=3 have generator polynomials g(x ^{2})=m _{1}(x ^{2})=1+(x ^{2})+(x ^{2})^{4} and \(g\left (x^{\frac {2}{3}}\right)=1+\left (x^{ \frac {2}{3}}\right)^{3}+\left (x^{\frac {2}{3}}\right)^{12}\) with the same error correction capability and code rate. The only difference is that the degree, data bits, code length, and check sum of the code C _{45} is three times that of code C _{15.}
Whereas, on letting \(\left (x^{\frac {2}{3}}\right)=y\) in the generating polynomial of (45,29) code, that is x ^{2}=y ^{3}, we get
Where the generating polynomial (x ^{2})^{4}+(x ^{2})+1 divides (x ^{2})^{13}+(x ^{2})^{12}+(x ^{2})^{7}+(x ^{2})^{3}+1. Hence, the corresponding vector is in (15,11). So (15,11) code is embedded in (45,29) code.
Similarly, in Table 6, we have shown that which code in \(F_{2}\left [x;2 \mathbb {Z} _{\geq 0}\right ]_{15}\) with designed distance d is embedded in a code in \( F_{2}\left [x;\frac {2}{3} \mathbb {Z} _{\geq 0}\right ]_{45}\) with designed distance d ^{′}.
The corresponding code vectors of the generating polynomials
Clearly v is properly contained in v ^{′}; in fact, it is repeated three times after a particular pattern. Hence, the generating matrix G ^{′} of \(g\left (x^{\frac {2}{3}}\right)\) will contain the generating matrix G of g(x ^{2}) such that \(G^{\prime }={\oplus _{1}^{3}}G.\)
The following lemma explains the relation between the minimal polynomials of the narrow sense BCH codes C _{ n } and C _{ bn }.
Lemma 8.
Let d,d ^{′} be the design distances of the narrow sense BCH codes C _{ n } and C _{ bn }, respectively. Then the exponents of the minimal polynomials m _{ i }(x ^{a}),i=1,3,…, d−1 of the code C _{ n } are equal to the exponents of the following minimal polynomials \(m_{b}\left (x^{\frac {a}{b}}\right),\) \(m_{3b}\left (x^{\frac {a}{b}}\right),\) …,\(m_{b(d1)}\left (x^{\frac {a}{b}}\right)\) of the code C _{ bn } with the same number of nonzero terms. The remaining minimal polynomials of the code C _{ bn } have exponents three times the exponents of the minimal polynomials m _{ i }(x ^{a}),i=1,3,…,d−1 of the code C _{ n } with same number of nonzero terms.
Proof is straightforward and easily follows from Examples 1 and 2.
General decoding principle
As the binary BCH code C _{ n } is embedded in the binary nonprimitive BCH code C _{ bn }, we only describe the decoding principal for the code C _{ bn }. We use the decoding procedure which follows the same principle as of the primitive binary BCH code.
Take \(a^{\prime }\in F_{2}^{bn}\) as a received vector. We obtain the syndrome matrix of a ^{′}, S(a ^{′})=a ^{′} H ^{T}. In this way, we calculate a table of syndromes which is useful in determining the error vector e such that S(a ^{′})=S(e). So, the decoding of received vector a ^{′} has done as the transmitted vector v ^{′}=a ^{′}−e. We adopt the algebraic method for finding e from the syndrome vector S(a ^{′}).
Let C _{ bn } be the binary nonprimitive BCH code with length bn and designed distance d ^{′}. Let H be the (d ^{′}−1)×b n matrix over \(F_{2^{bs}}.\phantom {\dot {i}\!}\) We use this matrix to define the syndrome of a vector \(a^{\prime }\in F_{2}^{bn}\) as S(a ^{′})=a ^{′} H ^{T}. Writing \(a^{\prime }=\left (a_{0}^{\prime },a_{1}^{\prime },\ldots,a_{bn1}^{\prime }\right) \) in the polynomial form \(a^{\prime }(x^{\frac {a}{b}})=a_{0}^{\prime }+a_{1}^{\prime }\left (x^{\frac {a}{b}}\right)+a_{2}^{\prime }\left (x^{\frac {a}{b} }\right)^{2}+\ldots +a_{bn1}^{\prime }\left (x^{\frac {a}{b}}\right)^{bn1}.\) So, the syndrome of the vector a ^{′}, S(a ^{′}) will be
and hence,
where \(S_{j}=a_{0}^{\prime }+a_{1}^{\prime }\alpha ^{j}+\ldots a_{bn1}^{\prime }\alpha ^{(bn1)j}=a^{\prime }(\alpha ^{j})\) for j=c ^{′},c ^{′}+1,…,c ^{′}+d ^{′}−2. Now, let a codeword v∈C _{ bn } be transmitted and the vector received is a ^{′}=v ^{′}+e, where e is the error vector. Then S(e)=S(a ^{′}). Let \(e\left (x^{\frac {a}{b}}\right)=e_{0}+e_{1}\left (x^{\frac {a}{b}}\right)+e_{2}\left (x^{\frac {a}{b}}\right)^{2}+\ldots +e_{bn1}\left (x^{ \frac {a}{b}}\right)^{bn1}\) be the error polynomial. Suppose i _{1},…,i _{ m } be the positions where an error has occurred. Then, e _{ i }≠0 if and only if i∈I={i _{1},…,i _{ m }}. Hence, \(e\left (x^{\frac {a}{b}}\right)=\sum _{i\in I}e_{i}\left (x^{\frac {a}{b}}\right)^{i}.\) Since the code corrects up to t errors, where \(t=\left \lfloor \frac {d^{\prime }1}{2}\right \rfloor.\) So we assume m≤t, that is 2m<d ^{′}. Since S(e)=S(a ^{′}), we have e(α ^{j})=S _{ j } for j=c ^{′},c ^{′}+1,…,c ^{′}+d ^{′}−2. Thus the 2m unknowns i _{1},…,i _{ m } and \( e_{i_{1}},\ldots,e_{i_{m}}\) satisfy the following system of d ^{′}−1 linear equations in \(e_{i_{1}},\ldots,e_{i_{m}}:\)
We first obtain a solution for the error positions i _{1},…,i _{ m }. We define the error locator polynomial \(f\left (x^{\frac {a}{b}}\right)=f_{0}+f_{1}\left (x^{\frac {a}{b}}\right)+f_{2}\left (x^{\frac {a}{b}}\right)^{2}+\ldots +f_{m1} \left (x^{\frac {a}{b}}\right)^{m1}+\left (x^{\frac {a}{b}}\right)^{m}.\) Since f(α ^{i})=0 for each i=I, we have
On multiplying this equation by e _{ i } α ^{ji}, we get
for each i∈I. Summing these m equations for i=i _{1},…,i _{ r } and using the relations (1), we have
for each j=c ^{′},c ^{′}+1,…,c ^{′}+m−1. Thus, the m unknowns f _{0},f _{1},…,f _{ m−1} satisfy the following m×m system of linear equations:
Let S denote the coefficient matrix in the above linear system. It can be verified by direct computation that S=V D V ^{T}, where
where V is a Vandermonde matrix. Since α is a nonprimitive bnth root of unity in \(\phantom {\dot {i}\!}F_{2^{bs}}\) and i _{1},…i _{ m } are distinct integers in {0,…,b n−1}, we have \(\phantom {\dot {i}\!}\alpha ^{i_{1}},\ldots,\alpha ^{i_{m}}\) are all distinct. Hence, detV≠0. Further, \(e_{i_{1}},\ldots,e_{i_{m}}\) are all nonzero and hence detD≠0. Therefore, detS≠0 and linear system (2) have a unique solution.
We have assumed that the number of positions where an error has occurred is m≤t. If the actual number of error positions is less than m, then for any choice of distinct positions i _{1},…i _{ m }, the coefficients \( e_{i_{1}},\ldots,e_{i_{m}}\) cannot be all zero. So, detD=0. Hence, m is the greatest positive integer ≤t such that system (2) has a unique solution. Therefore, we find the value of m by taking successively m=t,t−1,… in system (2) until we have a value for which system (2) has a unique solution, which gives us the error locator polynomial \(f\left (x^{ \frac {a}{b}}\right)=f_{0}+f_{1}\left (x^{\frac {a}{b}}\right)+f_{2}\left (x^{\frac {a}{b} }\right)^{2}+\ldots +f_{m1}\left (x^{\frac {a}{b}}\right)^{m1}+\left (x^{\frac {a}{b}}\right)^{m}.\) Now, to find the roots of \(f\left (x^{\frac {a}{b}}\right),\) we put \(x^{\frac {a}{b}}=\alpha ^{i},\) i=0,1,…. By the definition of \(f\left (x^{\frac {a}{b}}\right),\) these roots are \( \alpha ^{i_{1}},\ldots,\alpha ^{i_{m}}.\phantom {\dot {i}\!}\) Thus, we find the unique solution for the unknowns i _{1},…i _{ m }. Having thus found the error vector e, we decode the received vector a as the codeword v ^{′}=a ^{′}−e.
To compute the syndrome of a binary BCH code, we have S _{2}=(S _{1})^{2},S _{6}=(S _{3})^{2} and so on. We can compute the syndrome more easily by using the division algorithm. If \(m(x^{\frac {a}{b}})\) is the minimal polynomial of α, then S _{1}=a ^{′}(α) can be obtained by finding the remainder on dividing \(a^{\prime }\left (x^{\frac {a}{b}}\right)\) by \(m\left (x^{\frac {a}{b}}\right)\) and then putting \(x^{\frac {a}{b}}=\alpha \) in it. In general, to find S _{ j }, we divide \(a^{\prime }\left (x^{\frac {a}{b}}\right)\) by \(m\left (x^{\frac {a}{b }}\right)\) and find the remainder.
The decoding of the code C _{ n } from the decoding of the code C _{ bn } can be obtained as ; take \(x^{\frac {a}{b}}=y,\) which gives x ^{a}=y ^{b}. In this way, the code polynomial \(v(x^{\frac {a}{b}})\) in \(F_{2}[\!x;\frac {a}{b}\mathbb {Z}_{\geq 0}]_{\textit {bn}}\) becomes v ^{′}(y). Again on replacing y by y ^{b}, we get v ^{′}(y ^{b})=v ^{′}(x ^{a}). The remainder after dividing v(x ^{a}) by (x ^{a})^{n}−1, will be the decoded vector of \(F_{2}\left [x;a\mathbb {Z}_{\geq 0}\right ]_{n}\) and the generator polynomial g(x ^{a}) divides v(x ^{a}).
The above discussion can be sumed up in the following steps.

Step I: For binary nonprimitive BCH code C _{ bn } with designed distance d ^{′}, let \(a\left (x^{\frac {a}{b}}\right)\) be the received polynomial with m errors, where m≤t _{2}.

Step II: Compute the syndromesand find the value of m, such that the system (2) has a unique solution.

Step III: Step II gives us the error locator polynomial \(f\left (x^{\frac { a}{b}}\right).\) Now, find the roots of \(f\left (x^{\frac {a}{b}}\right)\) through which we obtain the error polynomial \(e\left (x^{\frac {a}{b}}\right).\vspace *{4pt}\)

Step IV: We decode the received polynomial \(a^{\prime }\left (x^{\frac {a}{ b}}\right)\) as \(v^{\prime }\left (x^{\frac {a}{b}}\right)=a^{\prime }\left (x^{\frac {a}{b}}\right)e\left (x^{ \frac {a}{b}}\right).\)

Step V: The code vector v in C _{ n } can be dragged out from the decoded code vector v ^{′} in C _{ bn } by putting \(x^{\frac {a}{b}}=y\) in corresponding code polynomial \(v^{\prime }\left (x^{\frac {a}{b}}\right)\). This gives \( v^{\prime }\left (x^{\frac {a}{b}}\right)=v^{\prime }(y).\) Again by replacing y by y ^{b}, we get v ^{′}(y)=v ^{′}(y ^{b})=v ^{′}(x ^{a}).

Step VI: Divide v ^{′}(x ^{a}) by (x ^{a})^{n}−1, the remainder v(x ^{a}) will be in \(F_{2}[\!x;a \mathbb {Z} _{\geq 0}]_{n},\) and the generator polynomial g(x ^{a}) divides v(x ^{a}). Then, its corresponding vector v∈C _{ n }.
Illustration
Let C _{45} be a (45,29) binary nonprimitive BCH code with design distance d ^{′}=4. Assume that \(a^{\prime }\left (x^{\frac {2}{3}}\right)=1+\left (x^{ \frac {2}{3}}\right)+\left (x^{\frac {2}{3}}\right)^{3}+\left (x^{\frac {2}{3}}\right)^{7}+\left (x^{\frac {2}{3} }\right)^{11}+\left (x^{\frac {2}{3}}\right)^{12}+\left (x^{\frac {2}{3}}\right)^{13}+\left (x^{\frac {2}{3} }\right)^{16}+\left (x^{\frac {2}{3}}\right)^{44}\) is the received polynomial. The error position m=2 and the syndromes are S _{1}=a ^{′}(α)=α ^{2}, S _{2}=(S _{1})^{2}=α ^{4}, S _{3}=a ^{′}(α ^{3})=α ^{30} and S _{4}=(S _{2})^{2}=α ^{8}. The error locator polynomial is given by \(f\left (x^{\frac {2}{3}}\right)=f_{0}+f_{1}\left (x^{\frac {2}{3}}\right)+\left (x^{ \frac {2}{3}}\right)^{2}.\) Then, we have the following system of equations for f _{0} and f _{1}.
Hence, the error locator polynomial is \(f\left (x^{\frac {2}{3}}\right)=\alpha ^{10}+\alpha ^{2}\left (x^{\frac {2}{3}}\right)+\left (x^{\frac {2}{3}}\right)^{2}.\) Trying successively x=1,α,α ^{2},…, we find that α ^{11} and α ^{44} are the roots. Hence, the error polynomial is \(e(x^{\frac {2}{3}})=\left (x^{\frac {2}{3}}\right)^{11}+(x^{\frac {2}{3}})^{44}.\) Thus, we decode \(a^{\prime }\left (x^{\frac {2}{3}}\right)\) as \(v^{\prime }\left (x^{\frac {2}{3}}\right)=a^{\prime }\left (x^{\frac {2}{ 3}}\right)+e\left (x^{\frac {2}{3}}\right)=\left (x^{\frac {2}{3}}\right)^{16}+\left (x^{\frac {2}{3}}\right)^{13}+\left (x^{ \frac {2}{3}}\right)^{12}+\left (x^{\frac {2}{3}}\right)^{7}+\left (x^{\frac {2}{3}}\right)^{3}+\left (x^{\frac {2}{3 }}\right)+1.\) Now, letting \(x^{\frac {2}{3}}=y,\) this gives y ^{3}=x ^{2}, we get
After dividing v ^{′}(x ^{2}) by (x ^{2})^{15}−1, we obtain the remainder v ^{′}(x ^{2}) as
where C _{15} is primitive binary BCH code (15,11) and it is due to the reason that the generator polynomial g(x ^{2})=(x ^{2})^{4}+(x ^{2})+1 divides v ^{′}(x ^{2}).
Conclusions
These are the following pronouncements of the study.

1)
The existence of a nonprimitive BCH code in \(F_{2}\left [x;\frac {a}{b} \mathbb {Z} _{0}\right ]_{\textit {bn}}\) of length bn based on a primitive BCH code of length n has been explained.

2)
The construction technique of bn length nonprimitive BCH code is given in such a manner that the binary BCH code C _{ n } is embedded in the binary BCH code C _{ bn } and thus the the transmitted data configurated through C _{ n } can be received through binary BCH code C _{ bn }.

3)
The binary BCH code C _{ bn } has higher code rate and error correction capability than binary BCH code C _{ n } along with a burst error correction capability.
This work can further be extended over the Galois field \(F_{2^{m}}\phantom {\dot {i}\!}\) and has applications in cognitive radio. Further, these results can be generalized to data mining.
References
 1
E Prange, Cyclic errorcorrecting codes in two symbols (Air force Cambridge research center, Cambridge, 1957). AFCRCTN57103.
 2
E Prange, The use of coset equivalence in the analysis and decoding of group codes (Air force Cambridge research center, Cambridge, 1959). AFCRCTR59164.
 3
WW Peterson, Encoding and errorcorrection procedures for the BoseChaudhuri codes. IRE Trans. IT6, 459–470 (1960).
 4
T Kasami, Systematic codes using binary shift register sequences. J. Info. Processing Soc. Japan. 1:, 198–200 (1960).
 5
J Cazaran, AV Kelarev, Generators and weights of polynomial codes. Archiv. Math. 69(6), 479–486 (1997).
 6
J Cazaran, AV Kelarev, On finite principal ideal rings. Acta Math. Univ. Comenianae. 68(1), 77–84 (1999).
 7
J Cazaran, AV Kelarev, SJ Quinn, D Vertigan D, An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings. Semigroup Forum. 73(3), 317–329 (2006).
 8
AV Kelarev, Ring Constructions and Applications (World Scientific, River Edge, New York, 2002).
 9
AV Kelarev, An algorithm for BCH codes extended with finite state automata. Fundamenta Informaticae. 84(1), 51–60 (2008).
 10
AV Kelarev, Algorithms for computing parameters of graphbased extensions of BCH codes. J. Discret. Algorithm. 5(6), 553–563 (2007).
 11
AA Andrade, T Shah, A Khan, A note on linear codes over semigroup rings. TEMA Tend. Mat. Apl. Comput. 12(2), 79–89 (2011).
 12
T Shah, AA Andrade, Cyclic codes through \(B\left [X;\frac {a}{b}\mathbb {Z}_{\geq 0}\right ]\) \(\left (\frac {a}{b}\in Q^{+},b=a+1\right)\) and Encoding. Discret. Math. Algoritm. Appl. 4(4) (2012). doi:http://dx.doi.org/10.1142/S1793830912500590.
 13
T Shah, AA Andrade, Cyclic codes through B[ X], \(B\left [X;\frac {1}{kp}, \mathbb {Z}_{\geq 0}\right ]\) and \(B\left [X;\frac {1}{p^{k}}\mathbb {Z}_{\geq 0}\right ]\): a comparison. J. Algebra Appl. 11(4) (2012). doi:http://dx.doi.org/10.1142/S0219498812500788.
 14
T Shah, Amanullah, AA Andrade, A method for improving the code rate and error correction capability of a cyclic code. Comput. Appl. Math. 32(2), 261–274 (2013).
 15
T Shah, Amanullah, AA Andrade, A decoding procedure which improves code rate and error corrections. JARAM. 4(4), 37–50 (2012).
 16
T Shah, A Khan, AA Andrade, Encoding through generalized polynomial codes. Comp. Appl. Math. 30(2), 349–366 (2011).
 17
T Shah, A Khan, AA Andrade, Constructions of codes through semigroup ring \(B\left [X;\frac {1}{2^{2}},\mathbb {Z}_{\geq 0}\right ]\) and encoding. Comput. Math. Appl. 62:, 1645–1654 (2011).
 18
T Shah, M Khan, AA Andrade, A decoding method of an n length binary BCH code through (n+1)n length binary cyclic code. Anais da Academia Brasileira de Ciê,ncias. 85(3), 863–872 (2013).
 19
SR Nagpaul, Sk Jain, Topics in Applied Abstract Algebra (Thomson, Brooks/Cole, USA, 2005).
 20
S Gao, D Panario, Tests and constructions of irreducible polynomials over finite fields, foundations of computational mathematics. (Foundations of Computational Mathematics, Cucker F, Shub M, eds.) (Springer, 1997).
 21
WW Peterson, EJ Weddon Jr., Error correcting codes, 2nd edittion (MIT Press, Cambridge, 1972).
Acknowledgements
The authors would like to thank the anonymous referees for their valuable comments and suggestions which improved the presentation of the paper.
Author information
Affiliations
Corresponding author
Additional information
Competing interests
Nonfinancial academic competing interest. This manuscript would be part of the author’s P.h.D thesis.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Ansari, A.S., Shah, T. An association between primitive and nonprimitive BCH codes using monoid rings. J Wireless Com Network 2016, 38 (2016). https://doi.org/10.1186/s1363801605263
Received:
Accepted:
Published:
Keywords
 BCH code
 Nonprimitive BCH code
 Monoid ring
 Error correction
 Code rate
Mathematical subject classification
 11T71
 94B15
 94B20
 94B60