English
Related papers

Related papers: On the Category of Group Codes

200 papers

A subset $D$ of an Abelian group is $decomposable$ if $\emptyset\ne D\subset D+D$. In the paper we give partial answer to an open problem asking whether every finite decomposable subset $D$ of an Abelian group contains a non-empty subset…

Group Theory · Mathematics 2019-05-03 Taras Banakh , Alex Ravsky

In this paper, we establish a rigidity result for automorphisms of multiplicative direct products of $D$-rings which are total ring of fraction that have pairwise distinct cardinalities. Under these assumptions, every automorphism acts…

Rings and Algebras · Mathematics 2026-05-12 Joseph Atalaye , Liam Baker , Sophie Marques

We study codes with a single check element derived from group rings, namely, checkable codes. The notion of a code-checkable group ring is introduced. Necessary and sufficient conditions for a group ring to be code-checkable are given in…

Information Theory · Computer Science 2010-12-30 Somphong Jitman , San Ling , Hongwei Liu , Xiaoli Xie

In this paper we discuss different properties of noncommutative schemes over a field. We define a noncommutative scheme as a differential graded category of a special type. We study regularity, smoothness and properness for noncommutative…

Algebraic Geometry · Mathematics 2016-08-15 Dmitri Orlov

We study the structure of the category of graded, connected, countable-dimensional, commutative and cocommutative Hopf algebras over a perfect field $k$ of characteristic $p$. Every $p$-torsion object in this category is uniquely a direct…

Algebraic Topology · Mathematics 2024-07-03 Tilman Bauer

A code is called transitive if its automorphism group (the isometry group) of the code acts transitively on its codewords. If there is a subgroup of the automorphism group acting regularly on the code, the code is called propelinear. Using…

Combinatorics · Mathematics 2014-11-12 I. Yu. Mogilnykh , F. I. Solov'eva

We show that a pointwise finite-dimensional persistence module indexed over a small category decomposes into a direct sum of indecomposables with local endomorphism rings. As an application of this result we give new, short proofs of…

Representation Theory · Mathematics 2019-10-07 Magnus Bakke Botnan , William Crawley-Boevey

Irreducible cyclic codes are one of the largest known classes of block codes which have been investigated for a long time. However, their weight distributions are known only for a few cases. In this paper, a class of irreducible cyclic…

Cryptography and Security · Computer Science 2013-09-06 Yun Song , Zhihui Li

Let $k$ be an algebraically closed field of characteristic $0$ or $p>2$. Let $\mathcal{G}$ be an affine supergroup scheme over $k$. We classify the indecomposable exact module categories over the tensor category ${\rm sCoh}_{\rm…

Quantum Algebra · Mathematics 2021-01-26 Shlomo Gelaki

A polynomial is a direct sum if it can be written as a sum of two non-zero polynomials in some distinct sets of variables, up to a linear change of variables. We analyze criteria for a homogeneous polynomial to be decomposable as a direct…

Algebraic Geometry · Mathematics 2015-02-25 Weronika Buczyńska , Jarosław Buczyński , Johannes Kleppe , Zach Teitler

An easily computable dimension (or ECD) group code in the group algebra $\mathbb{F}_{q}G$ is an ideal of dimension less than or equal to $p=char(\mathbb{F}_{q})$ that is generated by an idempotent. This paper introduces an easily computable…

Representation Theory · Mathematics 2024-04-10 E. J. García-Claro

In a graph $\Gamma$, a perfect code is an independent set $C$ with the property that every vertex not in $C$ is adjacent to a unique vertex in $C$, and a total perfect code is a set $C$ of vertices of $\Gamma$ such that every vertex of…

Combinatorics · Mathematics 2026-03-24 Xiaomeng Wang , Junyang Zhang

Usually, it is difficult to determine the weight distribution of an irreducible cyclic code. In this paper, we discuss the case when an irreducible cyclic code has the maximal number of distinct nonzero weights and give a necessary and…

Information Theory · Computer Science 2012-05-08 Chunming Tang , Yanfeng Qi , Maozhi Xu , Baocheng Wang , Yixian Yang

In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a general grid. We show that their algorithm can be adapted to solve…

Computational Complexity · Computer Science 2019-08-21 Srikanth Srinivasan , Utkarsh Tripathi , S. Venkitesh

A perfect code in a graph $\Gamma$ is a subset $C$ of $V(\Gamma)$ such that no two vertices in $C$ are adjacent and every vertex in $V(\Gamma)\setminus C$ is adjacent to exactly one vertex in $C$. Let $G$ be a finite group and $C$ a subset…

Combinatorics · Mathematics 2022-11-08 Junyang Zhang

In this paper we investigate hereditarily normal topological groups and their subspaces. We prove that every compact subspace of a hereditarily normal topological group is metrizable. To prove this statement we first show that a…

General Topology · Mathematics 2012-09-11 Raushan Buzyakova

It is known that every torsion-free abelian group of finite rank has a maximal completely decomposable summand that is unique up to isomorphism. We show that groups of infinite rank need not have maximal completely decomposable summands,…

Group Theory · Mathematics 2018-10-24 Gabor Braun. Phill Schultz , Lutz Struengmann

A groupoid is a small category in which each morphism has an inverse. A topological groupoid is a groupoid in which both sets of objects and morphisms have topologies such that all groupoid structure maps are continuous. The notion of…

Differential Geometry · Mathematics 2007-05-23 Osman Mucuk , Ilhan Icen

The GM-MDS theorem, conjectured by Dau-Song-Dong-Yuen and proved by Lovett and Yildiz-Hassibi, shows that the generator matrices of Reed-Solomon codes can attain every possible configuration of zeros for an MDS code. The recently emerging…

Information Theory · Computer Science 2025-06-05 Joshua Brakensiek , Manik Dhar , Sivakanth Gopi

Let F be a non-Archimedean locally compact field of residue characteristic p, let D be a finite dimensional central division F-algebra and let R be an algebraically closed field of characteristic different from p. To any irreducible smooth…

Representation Theory · Mathematics 2014-02-24 Vincent Sécherre , Shaun Stevens