English

Nonlinear Reed-Solomon codes and nonlinear skew quasi-cyclic codes

Information Theory 2025-02-12 v1 math.IT Rings and Algebras

Abstract

This article begins with an exploration of nonlinear codes (Fq\mathbb{F}_q-linear subspaces of Fqmn\mathbb{F}_{q^m}^n) which are generalizations of the familiar Reed-Solomon codes. This then leads to a wider exploration of nonlinear analogues of the skew quasi-cyclic codes of index \ell first explored in 2010 by Abualrub et al., i.e., Fqm[x;σ]\mathbb{F}_{q^m}[x;\sigma]-submodules of (Fqm[x;σ]/(xn1))\left(\mathbb{F}_{q^m}[x;\sigma]/(x^n - 1)\right)^\ell. After introducing nonlinear skew quasi-cyclic codes, we then determine the module structure of these codes using a two-fold iteration of the Smith normal form of matrices over skew polynomial rings. Finally we show that in certain cases, a single use of the Smith normal form will suffice to determine the elementary divisors of the code.

Keywords

Cite

@article{arxiv.2502.07242,
  title  = {Nonlinear Reed-Solomon codes and nonlinear skew quasi-cyclic codes},
  author = {Daniel Bossaller and Daniel Herden and Indalecio Ruiz-Bolanos},
  journal= {arXiv preprint arXiv:2502.07242},
  year   = {2025}
}

Comments

28 Pages

R2 v1 2026-06-28T21:39:42.712Z