Construction of reversible cyclic codes over 𝔽q + u𝔽q + u2𝔽q
Let q be a power of prime p. In this article, we investigate the reversible cyclic codes of arbitrary length n over the ring R = 𝔽q +u𝔽q + u2𝔽q, where u3 = 0 mod q. Further, we find a unique set of generators for cyclic codes over R and classify the reversible cyclic codes with their generators. Mor...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2023-03-01
|
| Series: | Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/auom-2023-0025 |