101. On [formula omitted]-cyclic codes and their applications in constructing optimal codes.
- Author
-
Dinh, Hai Q., Pathak, Sachin, Bag, Tushar, Upadhyay, Ashish Kumar, Bandi, Ramakrishna, and Yamaka, Woraphon
- Subjects
- *
COMMUTATIVE rings , *BINARY codes , *POLYNOMIALS - Abstract
Let R = F 2 + u F 2 (u 2 = 0) and S = F 2 + u F 2 + u 2 F 2 (u 3 = 0) be two finite commutative chain rings. This paper studies F 2 R S -cyclic codes, which are described as S [ x ] -submodules of the S [ x ] -module F 2 [ x ] ∕ 〈 x r − 1 〉 × R [ x ] ∕ 〈 x s − 1 〉 × S [ x ] ∕ 〈 x t − 1 〉. We study their generator polynomials and the minimal generating sets. We classify each case of the generating sets separately and determine the size of each such case. Free F 2 R S -cyclic codes and separable codes are discussed, and the structural properties of dual codes of free F 2 R S -cyclic codes are investigated. Moreover, we determine the relationship between the generator polynomials of free F 2 R S -cyclic codes and their duals. As applications, we provide several examples of optimal and near-optimal binary codes which are obtained from the Gray images of F 2 R S -cyclic codes. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF