English
Related papers

Related papers: On the Category of Group Codes

200 papers

In this paper, we study the combinatorics of congruence subgroups of the modular group by generalizing results obtained in the non-modular case. For this, we define a notion of irreducible solutions from which we can build all the…

Combinatorics · Mathematics 2021-12-08 Flavien Mabilat

(withdrawn.) For every lambda we give an explicit construction of an Abelian group with no non-trivial automorphisms. In particular the group absolutely has no non-trivial automorphisms, hence is absolutely indecomposable. Earlier we knew a…

Logic · Mathematics 2019-09-10 Saharon Shelah

We study the indecomposable summands of the permutation module obtained by inducing the trivial $\mathbb{F}(S_a\wr S_n)$-module to the full symmetric group $S_{an}$ for any field $\mathbb{F}$ of odd prime characteristic $p$ such that…

Representation Theory · Mathematics 2014-04-18 Eugenio Giannelli

In this paper, we introduce the concept of the independence graph of a directed 2-complex. We show that the class of diagram groups is closed under graph products over independence graphs of rooted 2-trees. This allows us to show that a…

Group Theory · Mathematics 2007-05-23 Victor Guba , Mark Sapir

In this paper, we shall give an explicit proof that constacyclic codes over finite commutative rings can be realized as ideals in some twisted group rings. Also, we shall study isometries between those codes and, finally, we shall study…

Information Theory · Computer Science 2023-07-26 Samir Assuena

MDS codes and self-dual codes are important families of classical codes in coding theory. It is of interest to investigate MDS self-dual codes. The existence of MDS self-dual codes over finite field $F_q$ is completely solved for $q$ is…

Information Theory · Computer Science 2022-08-30 Ruhao Wan , Shixin Zhu , Jin Li

We study the existence and uniqueness of direct sum decompositions in additive bicategories. We find a simple definition of Krull-Schmidt bicategories, for which we prove the uniqueness of decompositions into indecomposable objects as well…

Category Theory · Mathematics 2022-01-31 Ivo Dell'Ambrogio

Cyclic codes are an important class of linear codes, whose weight distribution have been extensively studied. So far, most of previous results obtained were for cyclic codes with no more than three zeros. Recently, \cite{Y-X-D12}…

Number Theory · Mathematics 2014-05-27 Jing Yang , Lingli Xia , Maosheng Xiong

Let \( G \) be a finite non-cyclic group. Define \( \mathrm{Cyc}(G) \) as the set of all elements \( a \in G \) such that for any $b\in G$, the subgroup \( \langle a, b \rangle \) is cyclic. The \emph{non-cyclic graph} $\Gamma(G)$ of \( G…

Combinatorics · Mathematics 2025-04-22 Parveen Parveen , Bikash Bhattacharjya

Let $p$ be prime, and $n,m \in \mathbb{N}$. When $K/F$ is a cyclic extension of degree $p^n$, we determine the $\mathbb{Z}/p^m\mathbb{Z}[\text{Gal}(K/F)]$-module structure of $K^\times/K^{\times p^m}$. With at most one exception, each…

Number Theory · Mathematics 2022-03-18 Jan Minac , Andrew Schultz , John Swallow

We consider the class of finitely generated groups which have a normal form computable in logspace. We prove that the class of such groups is closed under finite extensions, finite index subgroups, direct products, wreath products, and also…

Group Theory · Mathematics 2014-01-28 Murray Elder , Gillian Elston , Gretchen Ostheimer

A totally symmetric set is a finite subset of a group for which any permutation of the elements can be realized by conjugation in the ambient group. Such sets are rigid under homomorphisms, and so exert a great deal of control over the…

Group Theory · Mathematics 2022-04-27 Noah Caplinger , Nick Salter

New families of unit memory as well as multi-memory convolutional codes are constructed algebraically in this paper. These convolutional codes are derived from the class of group character codes. The proposed codes have basic generator…

Information Theory · Computer Science 2013-08-13 Giuliano G. La Guardia

Every torsion--free abelian group of finite rank has two essentially unique complete direct decompositions whose summands come from specific classes of groups.

Group Theory · Mathematics 2020-07-16 Phill Schultz

Let G be a noncyclic group of order 4, and let K be the ring Z of rational integers, the localization of Z at the prime 2 and the ring of 2-adic integers, respectively. We describe, up to conjugacy, all of the indecomposable subgroups in…

Representation Theory · Mathematics 2007-05-23 V. A. Bovdi , V. P. Rudko

Let $F=\{H_1,...,H_k\}$ be a family of graphs. A graph $G$ with $m$ edges is called {\em totally $F$-decomposable} if for {\em every} linear combination of the form $\alpha_1 e(H_1) + ... + \alpha_k e(H_k) = m$ where each $\alpha_i$ is a…

Combinatorics · Mathematics 2007-05-23 Raphael Yuster

The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of constructing UDMs is tightly connected to the problem of…

Information Theory · Computer Science 2007-07-13 Pascal O. Vontobel , Ashwin Ganesan

In this paper, several families of irreducible constacyclic codes over finite fields and their duals are studied. The weight distributions of these irreducible constacyclic codes and the parameters of their duals are settled. Several…

Information Theory · Computer Science 2022-07-06 Zhonghua Sun , Xiaoqiang Wang , Cunsheng Ding

We introduce a class of cycles, called nondegenerate, strictly decomposable cycles, and show that the image of each cycle in this class under the refined cycle map to an extension group in the derived category of arithmetic mixed Hodge…

Algebraic Geometry · Mathematics 2007-05-23 Andreas Rosenschon , Morihiko Saito

The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…

Information Theory · Computer Science 2026-05-26 Junjie Huang , Jicheng Ma , Chang-An Zhao
‹ Prev 1 3 4 5 6 7 10 Next ›