Skew Cyclic Codes Over 𝔽p + u𝔽p
In this paper, we study skew cyclic codes with arbitrary length over the ring R = 𝔽p + u𝔽p where p is an odd prime and u2 = 0. We characterise all skew cyclic codes of length n as left R[x;θ]-submodules of Rn = R[x;θ] / ⟨xn − 1⟩. We find all generator polynomials for these codes and describe their minimal spanning sets. Moreover, an encoding algorithm is presented for skew cyclic codes over the ring R. Finally, based on the theory we developed in this paper, we provide examples of codes with good parameters over Fp with different odd primes p: In fact, example 6 in our paper is a new ternary code in the class of quasi-twisted codes. We also present several examples of optimal codes.
Aydin, Noah (Nuh); Dastbasteh, R; Mousavi, H; and Haghighat, J, "Skew Cyclic Codes Over 𝔽p + u𝔽p" (2017). International Journal of Information and Coding Theory 5(1): 81-99. Faculty Publications. Paper 91.
International Journal of Information and Coding Theory