2. Cyclotomic Cosets
Let For consider iff for some integer This is an equivalence relation on S. The equivalence classes due to this relation are called q-cyclotomic cosets modulo . The q-cyclotomic coset containing is , where is the smallest positive integer such that .
Lemma 1. [8], If is the order of q modulo , then the order of q modulo is , .
Lemma 2. If is the order of q modulo then for , following holds:
(i)For order of q modulo where , is .
(ii)For order of q modulo where , is and modulo is .
(iii)For order of q modulo is , order of q modulo where , is , order of q modulo is .
Proof.
Since
is the order of q modulo
, therefore by lemma
, order of q modulo
is
,
. Hence
Since q is of the form , therefore . Hence, . As and order of q modulo is , so . This implies that is the smallest integer for which holds. Hence order of q modulo is . Again , since , so . Since order of q modulo is , so is the smallest integer for which equation holds. Hence order of q modulo is . On similar lines, we can obtain that the order of q modulo and is .
(ii)As by lemma
and
, since
However, as by lemma
and
is the least integer that satisfies the equation
2. So,
is the order of q modulo
. Proof of other parts are similar to
.
(iii) As by lemma
and
, since
, so
However, as by lemma
and
is the least integer that satisfies the equation
3. Thus
is the order of q modulo
. Proof of other parts are similar to part
and
. □
Lemma 3. For any odd prime p, there exist an integer g, which is a primitive root modulo p, further when p is of the form then order of g modulo 4, modulo 8 is 2 and modulo 16 is 4. and when p is of the form then order of g mod 4, mod 8 and modulo 16 is 2. Also, if q is any prime or prime power and , then .
Proof. Since p is an odd prime some will exist with . Consider a primitive root a in . For , define where is a prime and so . Thus g is primitive root modulo p. Further, , again . Clearly, . Hence, order of g modulo 2 is 1, again so . Therefore, order of g modulo 4 is 2. In the similar pattern, we can obtain that order of g modulo 8 and 16 are 2 and 4 respectively. Also, when where or 5 or 7, now for or 5, and for , , where is a prime will have the required properties. Further, due to order of g and order of q modulo p as and respectively, for some . □
Lemma 4. For and , , where , , , μ , ,ν, , η, ξ, ρ, χ and , , , , , , .
Proof. Proof can be obtained by using lemma and lemma . □
Theorem 1. For the q-cyclotomic cosets modulo are given by,
, for , , for , for and for , ,
and ,
where and g is as defined in lemma ,
when these are , for .
when these are , for and .
when these are , for , and .
Proof. (i)By definition, it is obvious that is trivial. Since q is of the form , So , so and hence also , so so and , so so . By lemma 2.2; equivalently, , so . Equivalently,
, so ,
again equivalently, , so
.
Obviously, , , for every , , and , So .
Hence it follows that these are the only distinct q-cyclotomic cosets modulo in this case.
Similarly other parts can be proved on similar lines. □
3. Primitive Idempotents Corresponding to ,
Throughout this paper, we consider to be th root of unity in some extension field of F. Let be the minimal ideal in , generated by , where is the minimal polynomial for . We denote , the primitive idempotent in , corresponding to the minimal ideal , given by where and .
Lemma 5. For cyclotomic cosets , where
where .
where .
Proof.
Since . Thus , therefore or .
Further is trivial. □
Lemma 6. For cyclotomic cosets
If
If
.
Proof.
Since So
Hence Now .
Now and . Hence .
Similarly, result holds for remaining □
Theorem 2. For , the explicit expressions for the primitive idempotents , in are given by:
, for .
, for .
, for .
.
Proof.
Since and , where α is th root of unity in . Taking , for all , so .
Evaluation of .
Since , .
, ,
, ,
, ,
, ,
. Using these in equation
5 the expressions for
can be obtained. Similarly,
for
can be obtained. □
Theorem 3. For , the explicit expressions for the primitive idempotents , in are given by
, for ,
, for ,
for ,
,
where .
Proof. Proof is similar to that of theorem 2. □
Theorem 4. For , the explicit expressions for the primitive idempotents , in are given by:
, for .
, for .
, for .
,
where .
Proof. Proof can be derived on same pattern to theorem 2. □
4. Primitive Idempotents Corresponding to , where
For we define: ; ; ;. Since .
However, therefore . Moreover, is a cyclotomic coset, therefore . Hence and so . Similarly,
Lemma 7. ,
Proof. By definition, , where .
As the set is a reduced residue system ,
therefore □
Lemma 8. ,
Proof. This result can be obtained on similar pattern as that of lemma and using the fact that is a reduced residue system . □
Lemma 9. For and then
and hence , for ,
and hence ,
and hence , for .
For , k is even then
and hence , for .
For , k is odd then
and hence , for .
Proof. For in , Since and . Further,
, as , therefore . Also ,
so and , thus . However , thus
and, therefore . Hence .
Proof of remaining can be obtained on similar pattern. □
Lemma 10. For , following holds:
If , and hence , for .
Proof. Proof can be derived on same pattern to lemma 9. □
Lemma 11. For ; ; ,
where and .
Proof. As α is th root of unity in some extension field of , so
Similarly, remaining can be obtained on simple multiplication.
If , then .
For , .
For , β is th root of unity. Then , which is possible when , due to lemma . So .
□
Proof of lemmas - can be obtained on similar reasoning as that of lemma , using definition of and .
Lemma 12. For ; ; ,
where , and .
Lemma 13. For ; ,
where and
Lemma 14. For ; ; ,
Proof. Assume , so .
For , .
For , then β is th root of unity. Then which is possible when
, due to lemma . So,
□
Proof of lemmas - can be obtained on similar reasoning as that of lemma , , using definition of and .
Lemma 15. For ; ; ,
Lemma 16. For ; ; ,
Lemma 17. For ; ; ,
Lemma 18. For ; ; ,
Lemma 19. For ; ; ,
Lemma 20. For ; ; ,
where and .
Lemma 21. For ; ; ,
where and .
Theorem 5. If the expressions for the primitive idempotents corresponding to , in are as follows:
,
,
where , ,
and and for all , .
Proof. Since , as obtained in lemma , so .
Thus for and using lemma , , wherever required we obtain,
for , for ,
Using all these in , the expression for is obtained.
Using lemma , , the expressions for , and can be derived. However, the expressions for and can be obtained by interchanging , by , respectively and vice versa in the expressions of , ,
Since and . Therefore for ; for ; for ;.
and
where . Using all these in , to obtain
which in turn implies
In particular, for , . Using lemma , to obtain
and and so
Relations for and can be derived using lemma and the fact that . □
Theorem 6. For , the expressions for the primitive idempotents corresponding to , in are as follows:
.
.
The expressions for and can be obtained by interchanging , by , respectively in the expressions of , ,
where , , and
and for all , .
Proof. These expressions can be obtained using lemmas - and on similar reasoning as that of theorem . Also relations can be derived using lemma - and , . □
5. Primitive Idempotents Corresponding to , where
For , define
, . Due to similar procedure as in section 4, , .
Proof of lemma can be obtained on similar lines as that of lemma , and represent , .
Lemma 22. For ; ; ,
where , , ,
Lemma 23. For ; ; ,
Lemma 24. For ; ; ,
where
Theorem 7. For , the expressions for the primitive idempotents corresponding to , are given by:
,
.
The expressions for and can be obtained by replacing , , , by , , , respectively and vice versa in the expressions of , ,
where , and , , , are defined in theorem 5 and for , .
Proof. These expressions can be derived using lemmas , −, with similar procedure as in theorem . Also the relations can be derived using and . □
Theorem 8. For , the expressions for the primitive idempotents analogous to are specified as:
,
,
where , and , , , are defined in theorem and for , .
Proof. Due to lemma , , so .
, for for . Due to lemma - , - , to obtain,
Using all these in equation , to get the expressions of . Using similar reason the expressions for can be derived.
Evaluation of and ,
By definition of primitive idempotents, .
for , , for , , for .
Due to lemma - , - , to obtain,
Using all these in , which gives
.
Using the value of , , , from theorem , which in turn implies
. In particular, for , .
Again using , to get .
Thus and , and for all , . □
6. Primitive Idempotents Corresponding to ,
For , define
, , , , Due to similar procedure as in section 4, , , , , .
Proof of lemma can be obtained on similar lines as that of lemma , and represent , , , , , .
Lemma 25. For and ; ,
where , , , .
Lemma 26. For and , ,
where , , , .
Lemma 27. For and , ,
Lemma 28. For and , ,
Theorem 9. For , the expressions for the primitive idempotents corresponding to , where are given by:
.
.
.
.
Where , , , can be obtained from the following relations,
, .
.
.
The expressions for , where can be obtained by interchanging , , , , by , , , , and by respectively and vice versa in the expressions of , where .
Proof. These expressions can be obtained using lemmas , −, , 25−26 with same procedure to the theorem 5. Also the relations can be derived using , , and . □
Theorem 10. For , the expressions for the primitive idempotents corresponding to , are given by
.
,
the expressions for and can be obtained by interchanging , , , by , , , and by respectively and vice versa in the expression of and . where , can be obtained from the following relations,
, .
Proof. These expressions can be derived using lemmas , 14−21, 23−24 , 27−28 with same procedure to the theorem 5. Also relations can be derived using and . □
7. Primitive Idempotents Corresponding to ,
For , define ; ; ; ; ; ; ; .
Using similar procedure as in section 4 to obtain , , , , , , , .
Lemma 29. For , ; ; ; ; where .
Proof. Since . So .
Remaining can be obtained in similar lines. □
Proof of lemma is similar to that of lemma and .
Lemma 30. For , ; ,
Lemma 31. For , ; ,
Lemma 32. For , ; ,
Lemma 33. For , ; ,
Lemma 34. For , ; ,
Lemma 35. For , ; ,
Theorem 11. For , the expressions for the primitive idempotents corresponding to , where are given by:
If ,
.
If then can be obtained by replacing the sign + to − and − to + of the terms when has odd suffix.
If ,
.
If , then can be obtained by replacing the sign of the terms + to − and − to + when has odd suffix.
If ,
.
If , then can be obtained by replacing the sign of the term + to − and − to + when has odd suffix.
If ,
.
If , then can be obtained by replacing the sign of the term + to − and − to + when has odd suffix.
If ,
.
If then can be obtained by replacing the sign of the term + to − and − to + when has odd suffix.
If ,
.
If , then can be obtained by replacing the sign of the term + to − and − to + when has odd suffix.
If ,
.
If , then can be obtained by replacing the sign of the term + to − and − to + when has odd suffix.
If ,
.
If , then can be obtained by replacing the sign of the term + to − and − to + when has odd suffix.
The expressions for , where can be obtained by interchanging , , , , , , , , , by , , , , , , , , , respectively and vice versa, also change the sign + to − and vice versa of when has odd suffix only,
where , , , , , , , can be obtained, using lemma 29 and the following relations,
,
,
,
.
Proof. These expressions can be obtained using lemmas , 11−13, 22, 25−26 and 30−33 with same procedure like to theorem 5. Also the relations can be derived using , , and . □
Theorem 12. For , the expressions for the primitive idempotents corresponding to , are given by:
.
The expressions for and can be obtained by replacing , , , , , by , , , , , and by respectively and vice versa, where , , , can be obtained using lemma 29 and the following relations,
, .
Proof. These expressions can be obtained using lemmas , 14−21, 23−24, 27−28 and 34−35 with same procedure like to theorem 5. Also the relations can be derived using and . □
10. Example
Example . Cyclic codes of length 48.
Take , ,, . Then the q-cyclotomic cosets are
, , , , , , , , , , , , , , , , , , , , .
Minimal polynomials for , where are , , , , , , , , , , , , , , , , , , , and respectively.
The minimal codes
, where
of length 48 are as follows:
| Code |
Dim. |
Min. Distance Bound |
Generating Polynomial |
|
1 |
48 |
, where
|
|
1 |
|
, where
|
|
4 |
|
|
|
2 |
|
|
|
4 |
24 |
|
|
2 |
|
|
|
4 |
|
|
|
2 |
48 |
|
|
4 |
|
|
| Code |
Dim. |
Min. Distance Bound |
Generating Polynomial |
|
2 |
|
|
|
4 |
|
|
|
2 |
24 |
|
|
2 |
|
|
|
4 |
24 |
|
|
2 |
|
|
|
2 |
|
|
|
2 |
48 |
|