English
Related papers

Related papers: Schur ring and Codes for $S$-subgroups over $\Z_{2…

200 papers

Galois images of polycyclic codes over a finite chain ring $S$ and their annihilator dual are investigated. The case when a polycyclic codes is Galois-disjoint over the ring $S,$ is characterized and, the trace codes and restrictions of…

Information Theory · Computer Science 2018-11-21 Edgar Martínez-Moro , Alexandre Fotue , Thomas Blackford

In this paper, we study the codes over the matrix ring over $\mathbb{Z}_4$, which is perhaps the first time the ring structure $M_2(\mathbb{Z}_4)$ is considered as a code alphabet. This ring is isomorphic to…

Information Theory · Computer Science 2018-07-16 Sanjit Bhowmick , Satya Bagchi , Ramakrishna Bandi

This is a note for constructing fundamental invariants and computing the Hilbert series of the invariant subalgebras of tensor products of polynomial rings under the action by a direct product of symmetric groups. Our computation relies on…

Combinatorics · Mathematics 2021-03-04 Zhipeng Lu

An $S$-ring (a Schur ring) is said to be separable with respect to a class of groups $\mathcal{K}$ if every algebraic isomorphism from the $S$-ring in question to an $S$-ring over a group from $\mathcal{K}$ is induced by a combinatorial…

Group Theory · Mathematics 2019-12-17 Grigory Ryabov

For a subspace $W$ of a vector space $V$ of dimension $n$, the Schur-product space $W^{\langle k\rangle}$ for $k \in \mathbb{N}$ is defined to be the span of all vectors formed by the component-wise multiplication of $k$ vectors in $W$. It…

Information Theory · Computer Science 2018-10-19 Brett Hemenway Falk , Nadia Heninger , Michael Rudow

In this paper, we study skew constacyclic codes over the ring $\mathbb{Z}_{q}R$ where $R=\mathbb{Z}_{q}+u\mathbb{Z}_{q}$, $q=p^{s}$ for a prime $p$ and $u^{2}=0$. We give the definition of these codes as subsets of the ring…

Information Theory · Computer Science 2018-10-16 Ahlem Melakhessou , Nuh Aydin , Kenza Guenda

Let $p$ be a prime integer, $n,s\geq 2$ be integers satisfying ${\rm gcd}(p,n)=1$, and denote $R=\mathbb{Z}_{p^s}[v]/\langle v^2-pv\rangle$. Then $R$ is a local non-principal ideal ring of $p^{2s}$ elements. First, the structure of any…

Information Theory · Computer Science 2017-10-27 Yuan Cao , Yonglin Cao

A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…

Combinatorics · Mathematics 2026-02-05 Ankan Shaw , Shibesh Kotal , Satya Bagchi

This paper investigates the algebraic structure of additive complementary pairs of cyclic codes over a finite commutative ring. We demonstrate that for every additive complementary pair of additive cyclic codes, both constituent codes are…

Information Theory · Computer Science 2025-06-13 Sanjit Bhowmick , Kuntal Deka , Alexandre Fotue Tabue , Edgar Martínez-Moro

An $S$-ring (a Schur ring) is said to be separable with respect to a class of groups $\mathcal{K}$ if every its algebraic isomorphism to an $S$-ring over a group from $\mathcal{K}$ is induced by a combinatorial isomorphism. We prove that…

Combinatorics · Mathematics 2019-12-17 Grigory Ryabov

Binary cyclic codes having large dimensions and minimum distances close to the square-root bound are highly valuable in applications where high-rate transmission and robust error correction are both essential. They provide an optimal…

Information Theory · Computer Science 2025-04-22 Mrinal Kanti Bose , Udaya Parampalli , Abhay Kumar Singh

Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and…

Information Theory · Computer Science 2015-04-14 Eli Ben-Sasson , Tuvi Etzion , Ariel Gabizon , Netanel Raviv

This paper classifies the derivations of group algebras in terms of the generators and defining relations of the group. If $RG$ is a group ring, where $R$ is commutative and $S$ is a set of generators of $G$ then necessary and sufficient…

Rings and Algebras · Mathematics 2018-12-05 Kieran Hughes , Leo Creedon

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

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

Let V(KG) be the normalized group of units of the group ring KG of a non-Dedekind group G with nontrivial torsion part t(G) over the integral domain K. We give a simple method for constructing free objects in V(KG).In particular, we show…

Group Theory · Mathematics 2014-11-27 Victor Bovdi

Given a group $G = H_1 \ast_A H_2$ which is the free product of two finitely generated groups $H_1$ and $H_2$ with amalgamation over a cyclic subgroup $A$ which is malnormal in $G$, we study relations between the structure of its subgroups…

Group Theory · Mathematics 2026-03-18 Martin Kreuzer , Anja Moldenhauer , Gerhard Rosenberger

The structure of multivariate semisimple codes over a finite chain ring $R$ is established using the structure of the residue field $\bar R$. Multivariate codes extend in a natural way the univariate cyclic and negacyclic codes and include…

Combinatorics · Mathematics 2007-05-23 E. Martinez-Moro , I. F. Rua

In this paper, we have studied cyclic codes over the ring $R=\mathbb{Z}_4+u\mathbb{Z}_4$, $u^2=0$. We have considered cyclic codes of odd lengths. A sufficient condition for a cyclic code over $R$ to be a $\mathbb{Z}_4$-free module is…

Information Theory · Computer Science 2015-01-08 Rama Krishna Bandi , Maheshanand Bhaintwal

The main result here is a characterisation of binary $2$-neighbour-transitive codes with minimum distance at least $5$ via their minimal subcodes, which are found to be generated by certain designs. The motivation for studying this class of…

Combinatorics · Mathematics 2018-07-27 Daniel R. Hawtin , Cheryl E. Praeger