Using Skew Cyclic Codes Over R = R1×R2×R3 to Detect Skew Cyclic Codes Over Fq

Authors

DOI:

https://doi.org/10.37256/cm.5420245789

Keywords:

linear codes, skew cyclic codes, gray map, optimal codes, automorphism

Abstract

This article investigates linear codes over the ring mceclip0-5abbb7d08d5ad23522dab8ed24436cdf.png, focusing on the properties and structure of skew cyclic codes within this framework. We explore various algebraic features of these codes, highlighting their distinctivenessfrom traditional cyclic codes. In addition, we examine the utility ofskew cyclic codes over mceclip1-8b622d3b70a82784c0eee7675c093910.png in the context of identifying skew cyclic codes over the finite field mceclip2-292a4dc0b304063bdd6b8986ae590203.png with optimal parameters. The findings offer fresh perspectives on developing efficient and high-performing coding systems, which could benefit error correction and data transmission applications.

Downloads

Published

2024-12-23

How to Cite

1.
Haddouche O, Chatouh K. Using Skew Cyclic Codes Over R = R<sub>1</sub>×R<sub>2</sub>×R<sub>3</sub> to Detect Skew Cyclic Codes Over F<sub>q</sub>. Contemp. Math. [Internet]. 2024 Dec. 23 [cited 2025 Jan. 21];5(4):6262-87. Available from: https://ojs.wiserpub.com/index.php/CM/article/view/5789