English
Related papers

Related papers: $\Theta_S-$cyclic codes over $A_k$

200 papers

For any commutative ring $A$ we introduce a generalization of $S$--artinian rings using a hereditary torsion theory $\sigma$ instead of a multiplicative closed subset $S\subseteq{A}$. It is proved that if $A$ is a totally $\sigma$--artinian…

Commutative Algebra · Mathematics 2021-01-26 Pascual Jara

Let $F$ be a number field with ring of integers $\Oc_F$ and $\Dc$ a division $F$-algebra with a maximal cyclic subfield $K$. We study rings occurring as quotients of a natural $\Oc_F$-order $\Lambda$ in $\Dc$ by two-sided ideals. We reduce…

Information Theory · Computer Science 2012-10-29 Frederique Oggier , B. A. Sethuraman

We revisit the famous theorem of Albert's on the cyclicity of tensor products of cyclic $p$-algebras. In the case of tensor products of cyclic $p$-algebras of prime degree, we provide an explicit computation of the resulting cyclic algebra…

Rings and Algebras · Mathematics 2025-10-22 Adam Chapman

We discuss quantum two-block codes, a large class of CSS codes constructed from two commuting square matrices.Interesting families of such codes are generalized-bicycle (GB) codes and two-block group-algebra (2BGA) codes, where a cyclic…

Quantum Physics · Physics 2023-08-01 Renyu Wang , Hsiang-Ku Lin , Leonid P. Pryadko

For a linear Hamming metric code of length n over a finite field, the number of distinct weights of its codewords is at most n. The codes achieving the equality in the above bound were called full weight spectrum codes. In this paper we…

Information Theory · Computer Science 2024-05-31 Chiara Castello , Olga Polverino , Ferdinando Zullo

Let $f(u)$ and $g(v)$ be two polynomials of degree $k$ and $\ell$ respectively, not both linear, which split into distinct linear factors over $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u,v]/\langle f(u),g(v),\\uv-vu\rangle$ be a…

Information Theory · Computer Science 2019-05-31 Swati Bhardwaj , Madhu Raka

In this work, four circulant and quadratic double circulant (QDC) constructions are applied to the family of the rings R_k,m. Self-dual binary codes are obtained as the Gray images of self-dual QDC codes over R_k,m. Extremal binary…

Information Theory · Computer Science 2016-10-31 Abidin Kaya , Nesibe Tüfekçi

We establish connections between silting and tilting objects in an abelian category $\mathcal{B}$ and those in a cleft extension $\mathcal{A}$ of $\mathcal{B}$, which provides a method for constructing more silting and tilting objects. Then…

Representation Theory · Mathematics 2026-02-10 Guoqiang Zhao , Juxiang Sun

Let $R$ be a finite commutative chain ring, $D_{2n}$ be the dihedral group of size $2n$ and $R[D_{2n}]$ be the dihedral group ring. In this paper, we completely characterize left ideals of $R[D_{2n}]$ (called left $D_{2n}$-codes) when ${\rm…

Information Theory · Computer Science 2021-05-18 H. Aghili , R. Sobhani

Let $K=Q(\sqrt{-\ell})$ be an imaginary quadratic field with ring of integers $\O_K$, where $\ell$ is a square free integer such that $\ell\equiv 3 \mod 4$ and $C=[n, k]$ be a linear code defined over $\O_K/2\O_K$. The level $\ell$ theta…

Algebraic Geometry · Mathematics 2012-09-05 T. Shaska , G. S. Wijesiri

In this paper, we investigate polycyclic codes associated with a trinomial of arbitrary degree $n$ over a finite chain ring $ R.$ We extend the concepts of $ n $-isometry and $ n $-equivalence known for constacyclic codes to this class of…

Information Theory · Computer Science 2025-03-18 Abdelghaffar Chibloun , Hassan Ou-azzou , Edgar Martínez-Moro , Mustapha Najmeddine

We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalizes the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and…

Information Theory · Computer Science 2015-02-06 Itzhak Tamo , Alexander Barg , Sreechakra Goparaju , Robert Calderbank

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

Let $q$ be a power of a prime $p$. In this paper, we study reversible cyclic codes of arbitrary length over the ring $ R = \mathbb{F}_q + u \mathbb{F}_q$, where $u^2=0 mod q$. First, we find a unique set of generators for cyclic codes over…

Information Theory · Computer Science 2019-10-16 Om Prakash , Shikha Patel , Shikha Yadav

We present a deterministic polynomial-time algorithm that determines whether a finite module over a finite commutative ring is cyclic, and if it is, outputs a generator.

Commutative Algebra · Mathematics 2015-04-06 H. W. Lenstra , A. Silverberg

Let $S_1, \cdots, S_N$ simple finite-dimensional modules of a quantum affine algebra. We prove that if $S_i\otimes S_j$ is cyclic for any $i < j$ (i.e. generated by the tensor product of the highest weight vectors), then $S_1\otimes \cdots…

Quantum Algebra · Mathematics 2020-05-18 David Hernandez

We introduce a strong homotopy notion of a cyclic symmetric inner product of an A-infinity algebra and prove a characterization theorem in the formalism of the infinity inner products by Tradler. We also show that it is equivalent to the…

Algebraic Topology · Mathematics 2007-09-27 Cheol-Hyun Cho

The generalized wreath product of permutation groups is introduced. By means of it we study the schurity problem for S-rings over a cyclic group $G$ and the automorphism groups of them. Criteria for the schurity and non-schurity of the…

Combinatorics · Mathematics 2015-05-07 Sergei Evdokimov , Ilya Ponomarenko

In this paper we give the enumeration formulas for Euclidean self-dual skew-cyclic codes over finite fields when $(n,|\theta|)=1$ and for some cases when $(n,|\theta|)>1,$ where $n$ is the length of the code and $|\theta|$ is the order of…

Information Theory · Computer Science 2017-05-18 Irwansyah , Intan Muchtadi-Alamsyah , Ahmad Muchlis , Aleams Barra , Djoko Suprijanto

We use the algebraic structure of cyclic codes and some properties of the discrete Fourier transform to give a reformulation of several classical bounds for the distance of cyclic codes, by extending techniques of linear algebra. We propose…

Information Theory · Computer Science 2016-04-01 Matteo Piva , Massimiliano Sala
‹ Prev 1 8 9 10 Next ›