English
Related papers

Related papers: Dual skew codes from annihilators: Transpose Hammi…

200 papers

Employing isomorphisms between their ambient rings, we propose new definitions of equivalence and isometry for skew polycyclic codes that will lead to tighter classifications than existing ones. This reduces the number of previously known…

Information Theory · Computer Science 2026-02-24 Susanne Pumpluen

The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming…

Information Theory · Computer Science 2018-07-23 José Gómez-Torrecillas , Gabriel Navarro , F. J. Lobillo , Alessandro Neri

Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right…

Information Theory · Computer Science 2010-10-04 Somphong Jitman , San Ling , Patanee Udomkavanich

This work studies skew polycyclic codes over finite chain rings defined by central trinomials. For this class of codes, we investigate Hamming equivalence in the non-commutative (skew) setting. We introduce an equivalence relation on the…

Information Theory · Computer Science 2026-05-06 Maryam Bajalan , Edgar Martínez-Moro , Hassan Ou-azzou

We provide an algebraic description for sum-rank metric codes, as quotient space of a skew polynomial ring. This approach generalizes at the same time the skew group algebra setting for rank-metric codes and the polynomial setting for codes…

Combinatorics · Mathematics 2021-05-24 Alessandro Neri

We introduce circulant matrices that capture the structure of a skew-polynomial ring F[x;\theta] modulo the left ideal generated by a polynomial of the type x^n-a. This allows us to develop an approach to skew-constacyclic codes based on…

Information Theory · Computer Science 2014-09-30 Neville Fogarty , Heide Gluesing-Luerssen

In this paper, we study the algebraic structure of $(\sigma,\delta)$-polycyclic codes, defined as submodules in the quotient module $S/Sf$, where $S=R[x,\sigma,\delta]$ is the Ore extension ring, $f\in S$, and $R$ is a finite but not…

Information Theory · Computer Science 2024-03-01 Maryam Bajalan , Ivan Landjev , Edgar Martínez-Moro , Steve Szabo

We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since…

Rings and Algebras · Mathematics 2016-08-16 Delphine Boucher , Willi Geiselmann , Félix Ulmer

We extend the existing skew polynomial representations of matrix algebras which are direct sum of matrix spaces over division rings. In this representation, the sum-rank distance between two tuples of matrices is captured by a weight…

Information Theory · Computer Science 2025-12-10 Alessandro Neri , Paolo Santonastaso

Skew polynomial rings provide a fundamental example of noncommutative principal ideal domains. Special quotients of these rings yield matrix algebras that play a central role in the theory of rank-metric codes. Recent breakthroughs have…

Information Theory · Computer Science 2025-11-10 José Gómez-Torrecillas , F. J. Lobillo , Gabriel Navarro , Paolo Santonastaso

We propose a decoding algorithm for a class of convolutional codes called skew BCH convolutional codes. These are convolutional codes of designed Hamming distance endowed with a cyclic structure yielding a left ideal of a non-commutative…

Information Theory · Computer Science 2016-07-26 José Gómez-Torrecillas , F. J. Lobillo , Gabriel Navarro

This paper investigates the application of the theoretical algebraic notion of a separable ring extension, in the realm of cyclic convolutional codes or, more generally, ideal codes. We work under very mild conditions, that cover all…

Information Theory · Computer Science 2014-08-08 José Gómez-Torrecillas , F. J. Lobillo , Gabriel Navarro

Two new classes of skew codes over a finite field $\F$ are proposed, called skew convolutional codes and skew trellis codes. These two classes are defined by, respectively, left or right sub-modules over the skew fields of fractions of skew…

Information Theory · Computer Science 2021-02-03 Vladimir Sidorenko , Wenhui Li , Onur Günlü , Gerhard Kramer

In this paper we investigate left ideals as codes in twisted skew group rings. The considered rings, which are often algebras over a finite field, allows us to detect many of the well-known codes. The presentation, given here, unifies the…

Information Theory · Computer Science 2022-12-27 Angelot Behajaina , Martino Borello , Javier de la Cruz , Wolfgang Willems

Skew polynomials are a class of non-commutative polynomials that have several applications in computer science, coding theory and cryptography. In particular, skew polynomials can be used to construct and decode evaluation codes in several…

Information Theory · Computer Science 2022-02-21 Hannes Bartz , Thomas Jerkovits

A large class of MDS linear codes is constructed. These codes are endowed with an efficient decoding algorithm. Both the definition of the codes and the design of their decoding algorithm only require from Linear Algebra methods, making…

Information Theory · Computer Science 2020-06-02 José Gómez-Torrecillas , Gabriel Navarro , José Patricio Sánchez-Hernández

In this paper, the investigation on the algebraic structure of the ring $\frac{\mathbb{F}_q[v]}{\langle\,v^q-v\,\rangle}$ and the description of its automorphism group, enable to study the algebraic structure of codes and their dual over…

Information Theory · Computer Science 2019-02-28 Joël Kabore , Alexandre Fotue-Tabue , Kenza Guenda , Mohammed E. Charkani

General isometries of cyclic codes, including multipliers and translations, are introduced; and isometrically self-dual cyclic codes are defined. In terms of Type-I duadic splittings given by multipliers and translations, a necessary and…

Information Theory · Computer Science 2016-10-05 Yun Fan , Liang Zhang

In this article, we present a new construction of evaluation codes in the Hamming metric, which we call twisted Reed-Solomon codes. Whereas Reed-Solomon (RS) codes are MDS codes, this need not be the case for twisted RS codes. Nonetheless,…

Information Theory · Computer Science 2022-01-25 Peter Beelen , Sven Puchinger , Johan Rosenkilde

This dissertation considers new constructions and decoding approaches for error-correcting codes based on non-conventional polynomials, with the objective of providing new coding solutions to the applications mentioned above. With skew…

Information Theory · Computer Science 2025-01-08 Hedongliang Liu
‹ Prev 1 2 3 10 Next ›