Skew cyclic codes over F_p + uF_p

From MaRDI portal
Publication:1993391

DOI10.1504/IJICOT.2018.091854zbMATH Open1431.94182arXiv1712.07783MaRDI QIDQ1993391FDOQ1993391


Authors: Yanyan Li Edit this on Wikidata


Publication date: 5 November 2018

Published in: International Journal of Information and Coding Theory (Search for Journal in Brave)

Abstract: In this paper, we study skew cyclic codes with arbitrary length over the ring R=mathbbFp+umathbbFp where p is an odd prime and %u2=0. We characterize all skew cyclic codes of length n as left %R[x;heta]-submodules of Rn=R[x;heta]/langlexn1angle. We find all generator polynomials for these codes and describe their minimal spanning sets. Moreover, an encoding and decoding 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 prime p. In fact, example 25 in our paper is a new ternary code in the class of quasi-twisted codes. The other examples we provided are examples of optimal codes.


Full work available at URL: https://arxiv.org/abs/1712.07783




Recommendations





Cited In (11)





This page was built for publication: Skew cyclic codes over \(\mathbb{F}_{p} + u\mathbb{F}_{p}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1993391)