English
Related papers

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

200 papers

In this paper, cyclic codes are established over some finite quaternion integer rings with respect to the quaternion Mannheim distance, and de- coding algorithm for these codes is given.

Information Theory · Computer Science 2010-03-24 Murat Guzeltepe , Mehmet Ozen

The cyclic code is a subclass of linear codes and has applications in consumer electronics, data storage systems and communication systems due to the efficient encoding and decoding algorithms. In 2013, Ding, et al. presented nine open…

Information Theory · Computer Science 2025-06-12 Dong He , Peipei Zheng , Qunying Liao

Braman [B08] described a construction where third-order tensors are exactly the set of linear transformations acting on the set of matrices with vectors as scalars. This extends the familiar notion that matrices form the set of all linear…

Numerical Analysis · Mathematics 2010-05-12 Carmeliza Navasca , Michael Opperman , Timothy Penderghest , Christino Tamon

Let $A$ and $B$ be subsets of a finite group $G$ and $r$ a positive integer. If for every $g\in G$, there are precisely $r$ pairs $(a,b)\in A\times B$ such that $g=ab$, then $B$ is called a code in $G$ with respect to $A$ and we write $r…

Combinatorics · Mathematics 2025-12-23 Teng Fang , Jinbao Li

Let $\mathbb{F}_q$ be a finite field of $q=p^m$ elements where $p$ is a prime and $m$ is a positive integer. This paper considers $(\gamma,\Delta)$-cyclic codes over a class of finite non-chain commutative rings…

Information Theory · Computer Science 2025-02-25 Om Prakash , Shikha Patel , Habibul Islam

We introduce the notion of "color rules" for computing class functions of $Z_k \wr S_n$, where $Z_k$ is the cyclic group of order $k$ and $S_n$ is the symmetric group on $n$ letters. Using a general sign-reversing involution and a map of…

Combinatorics · Mathematics 2026-02-25 Fabián Levicán-Santibáñez , Marino Romero

Let $\mathbb{F}_q$ be a finite field with $q$ elements and denote by $\theta : \mathbb{F}_q\to\mathbb{F}_q$ an automorphism of $\mathbb{F}_q$. In this paper, we deal with linear codes of $\mathbb{F}_q^n$ invariant under a semi-linear map…

Information Theory · Computer Science 2013-12-02 Luis Felipe Tapia Cuitiño , Andrea Luigi Tironi

Two families of complementary codes over finite fields $\mathbb{F}_q$ are studied, where $q=r^2$ is square: i) Hermitian complementary dual linear codes, and ii) trace Hermitian complementary dual subfield linear codes. Necessary and…

Information Theory · Computer Science 2017-10-13 Kriangkrai Boonniyom , Somphong Jitman

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

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

The subject of this paper is the cycle structure of the random permutation $\sigma$ of $[N]$, which is the product of $k$ independent random cycles of maximal length $N$. We use the character-based Fourier transform to study the number of…

Combinatorics · Mathematics 2016-10-13 Miklos Bona , Boris Pittel

We study cyclic codes with arbitrary length over Fp+vFp where theta(v)=av, a in Fp and v^2=0. We characterize all existing codes in case of O(theta)|n by using certain projections from (Fp+vFp)[x;theta] to Fp[x]. We provide an explicit…

Rings and Algebras · Mathematics 2016-07-06 Reza Dastbasteh , Seyyed Hamed Mousavi , Javad Haghighat

We give a generalization of subspace codes by means of codes of modules over finite commutative chain rings. We define a new class of Sperner codes and use results from extremal combinatorics to prove the optimality of such codes in…

Information Theory · Computer Science 2023-09-25 Mima Stanojkovski

This paper builds on our earlier proposal for construction of a positive inner product for pseudo-Hermitian Hamiltonians and we give several examples to clarify our method. We show through the example of the harmonic oscillator how our…

Quantum Physics · Physics 2011-04-07 Ashok Das , L. Greenwood

We study aisles in the derived category of a hereditary abelian category. Given an aisle, we associate a sequence of subcategories of the abelian category by considering the different homologies of the aisle. We then obtain a sequence,…

Category Theory · Mathematics 2012-02-23 Donald Stanley , Adam-Christiaan van Roosmalen

We investigate the class of CSS-$T$ codes, a family of quantum error-correcting codes that allows for a transversal $T$-gate. We extend the definition of a pair of linear codes $(C_1,C_2)$, $C_i\subseteq\mathbb{F}_q^n$, forming a $q$-ary…

Quantum Physics · Physics 2025-07-24 Jasper J. Postema , F. Conca , A. Ravagnani

Locally recoverable (LRC) codes and their variants have been extensively studied in recent years. In this paper we focus on cyclic constructions of LRC codes and derive conditions on the zeros of the code that support the property of…

Information Theory · Computer Science 2020-04-16 Zitan Chen , Alexander Barg

We study orbit codes in the field extension ${\mathbb F}_{q^n}$. First we show that the automorphism group of a cyclic orbit code is contained in the normalizer of the Singer subgroup if the orbit is generated by a subspace that is not…

Information Theory · Computer Science 2021-01-26 Heide Gluesing-Luerssen , Hunter Lehmann

Two generalizations of the Hartmann--Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a cyclic product code. Furthermore, we show that unique…

Information Theory · Computer Science 2013-06-28 Alexander Zeh , Antonia Wachter-Zeh , Maximilien Gadouleau , Sergey Bezzateev

We study Hamiltonian and symplectic tensor structures in the T-product algebra. We define T-Hamiltonian and T-symplectic tensors and characterize them through their Fourier-domain slices. For T-Hamiltonian tensors we establish the standard…

Numerical Analysis · Mathematics 2026-05-21 Susana Lopez-Moreno , Taehyeong Kim