English
Related papers

Related papers: On polycyclic codes over a finite chain ring

200 papers

This paper is on the inverse parameterized differential Galois problem. We show that surprisingly many groups do not occur as parameterized differential Galois groups over K(x) even when K is algebraically closed. We then combine the method…

Commutative Algebra · Mathematics 2016-03-23 Annette Bachmayr

Let $\mathcal{R}_e=GR(p^e,r)[y]/\langle g(y),p^{e-1}y^t\rangle$ be a finite commutative chain ring, where $p$ is a prime number, $GR(p^e,r)$ is the Galois ring of characteristic $p^e$ and rank $r,$ $t$ and $k$ are positive integers…

Information Theory · Computer Science 2024-12-16 Leijo Jose , Anuradha Sharma

The purpose of this article is to study polycyclic codes over the ring $\frac{\mathbb{F}_{p^m}[u]}{\langle u^t \rangle}, \,t \geq 1$, and their associated torsion codes. It is shown that if $\phi$ is a surjective ring homomorphism from a…

Information Theory · Computer Science 2026-04-07 Akanksha Tiwari , Pramod Kanwar , Ritumoni Sarma

Toric codes are obtained by evaluating rational functions of a nonsingular toric variety at the algebraic torus. One can extend toric codes to the so called generalized toric codes. This extension consists on evaluating elements of an…

Information Theory · Computer Science 2010-02-25 Diego Ruano

We determine the minimum possible column multiplicity of even, doubly-, and triply-even codes given their length. This refines a classification result for the possible lengths of $q^r$-divisible codes over $\mathbb{F}_q$. We also give a few…

Combinatorics · Mathematics 2023-11-06 Theresa Körner , Sascha Kurz

In this work, linearized multivariate skew polynomials over division rings are introduced. Such polynomials are right linear over the corresponding centralizer and generalize linearized polynomial rings over finite fields, group rings or…

Rings and Algebras · Mathematics 2021-12-07 Umberto Martínez-Peñas

We generalise Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in the Galois group. We derive some conditions on the…

Information Theory · Computer Science 2017-03-28 Daniel Augot , Pierre Loidreau , Gwezheneg Robert

Let $r_1$ and $r_2$ be positive integers with $r_1 \le r_2$. A graph $G$ is called $2$-DCC vertex $[r_1,r_2]$-pancyclic if, for any two distinct vertices of $G$ and any integer $\ell \in [r_1,r_2]$, there exist two vertex-disjoint cycles of…

Combinatorics · Mathematics 2026-05-28 Chang Liu , Ruichao Niu , Yuefeng Yang

In this paper, we define Abelian and consta-Abelian polyadic codes over rings defined as affine algebras over chain rings. For that aim, we use the classical construction via splittings and multipliers of the underlying Abelian group. We…

Information Theory · Computer Science 2023-01-02 Gülsüm Gözde Yılmazgüç , Javier de la Cruz , Edgar Martínez-Moro

We consider quantum walks on a finite graphs to which infinite tails are attached. We explore how the propagating and bound states depend on the structure of the finite graph. The S-matrix for such graphs is defined. Its unitarity is proved…

Quantum Physics · Physics 2010-02-11 Martin Varbanov , Todd A. Brun

Two-dimensional cyclic codes of length $n=\ell s$ over the finite field $\mathbb{F}$ are ideals of the polynomial ring $\frac{\mathbb{F}[x,y]}{< x^{s}-1,y^{\ell}-1 >}$. The aim of this paper, is to present a novel method to study the…

Commutative Algebra · Mathematics 2017-04-27 Zahra Sepasdar

We study cyclotomic association schemes over a finite commutative ring $R$ with identity. The main interest for us is to identify the normal cyclotomic schemes $C$, i.e. those for which $Aut(C)$ is a subgroup of the one-dimensional affine…

Combinatorics · Mathematics 2010-12-27 Sergei Evdokimov , Ilia Ponomarenko

Let G be a finitely generated linear group over a field of characteristic 0. Suppose that every solvable subgroup of G is polycyclic. Then the claim is made that any solvable subgroup of G is separable. This is proven for G=SL_n(Z).…

Group Theory · Mathematics 2007-05-23 Roger Alperin , Benson Farb

In this paper, we study negacyclic codes of odd length and of length $2^k$ over the ring $R=\mathbb{Z}_4+u\mathbb{Z}_4$, $u^2=0$. We give the complete structure of negacyclic codes for both the cases. We have obtained a minimal spanning set…

Information Theory · Computer Science 2014-12-12 Rama Krishna Bandi , Maheshanand Bhaintwal

We search for dual gauge theories of all-loop finite, N = 1 supersymmetric gauge theories. It is shown how to find explicitly the dual gauge theories of almost all chiral, N = 1, all-loop finite gauge theories, while several models have…

High Energy Physics - Theory · Physics 2009-10-07 Andreas Karch , Dieter Lust , George Zoupanos

In coding theory, a very interesting problem (but at the same time, a very difficult one) is to determine the weight distribution of a given code. This problem is even more interesting for cyclic codes, and this is so, mainly because they…

Information Theory · Computer Science 2016-06-29 Gerardo Vega

Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we provide a slightly different approach toward the general problem and use it to solve one more special…

Number Theory · Mathematics 2011-11-15 Maosheng Xiong

Given a ring object $A$ in a symmetric monoidal category, we investigate what it means for the extension $\mathbb{1}\rightarrow A$ to be (quasi-)Galois. In particular, we define splitting ring extensions and examine how they occur.…

Category Theory · Mathematics 2018-03-16 Bregje Pauwels

In this paper, we give conditions for the existence of Hermitian self-dual $\Theta-$cyclic and $\Theta-$negacyclic codes over the finite chain ring $\mathbb{F}_q+u\mathbb{F}_q$. By defining a Gray map from $R=\mathbb{F}_q+u\mathbb{F}_q$ to…

Information Theory · Computer Science 2019-03-20 Zineb Hebbache , Kenza Guenda , N. Tugba Özzaim , Mehmet Özen , T. Aaron Gulliver

This paper considers the equivalence problem for quasi-cyclic codes over finite fields. The results obtained are used to construct isodual quasi-cyclic codes.

Information Theory · Computer Science 2016-07-27 Kenza Guenda , T. Aaron Gulliver