Abstract
In this work, we focus on cyclic codes over the ring F2+uF 2+vF2+uvF2, which is not a finite chain ring. We use ideas from group rings and works of AbuAlrub et.al. in (Des Codes Crypt 42:273-287, 2007) to characterize the ring (F2+uF2+vF 2+uvF2)/(xn-1) and cyclic codes of odd length. Some good binary codes are obtained as the images of cyclic codes over F 2+uF2+vF2+uvF2 under two Gray maps that are defined. We also characterize the binary images of cyclic codes over F2+uF2+vF2+uvF2 in general.
Original language | English (US) |
---|---|
Pages (from-to) | 221-234 |
Number of pages | 14 |
Journal | Designs, Codes, and Cryptography |
Volume | 58 |
Issue number | 3 |
DOIs | |
State | Published - Mar 2011 |
Externally published | Yes |
Keywords
- Cyclic codes
- Gray maps
- Homogeneous weight
- Lee weight
- Quasi-cyclic codes
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science Applications
- Discrete Mathematics and Combinatorics
- Applied Mathematics