English
Related papers

Related papers: Group code structures on affine-invariant codes

200 papers

Let $\{G_i :i\in\N\}$ be a family of finite Abelian groups. We say that a subgroup $G\leq \prod\limits_{i\in \N}G_i$ is \emph{order controllable} if for every $i\in \mathbb{N}$ there is $n_i\in \mathbb{N}$ such that for each $c\in G$, there…

General Topology · Mathematics 2021-12-01 María V. Ferrer , Salvador Hernández

We construct group codes over two letters (i.e., bases of subgroups of a two-generated free group) with special properties. Such group codes can be used for reducing algorithmic problems over large alphabets to algorithmic problems over a…

Group Theory · Mathematics 2007-05-23 Jean-Camille Birget , Stuart W. Margolis

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

Let p be a fixed prime. An Abelian p-group is an Abelian group (not necessarily finitely generated) in which every element has for its order some power of p. The countable Abelian p-groups are classified by Ulm's theorem, and Khisamiev…

Logic · Mathematics 2008-05-14 W. Calvert , D. Cenzer , V. S. Harizanov , A. Morozov

Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of…

Information Theory · Computer Science 2016-01-27 Can Xiang , Chunming Tang , Keqin Feng

Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and…

Information Theory · Computer Science 2017-04-10 Shudi Yang , Xiangli Kong , Chunming Tang

In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…

Information Theory · Computer Science 2019-04-16 Irwansyah , Intan Muchtadi-Alamsyah , Aleams Barra

The toric code can be constructed as a gauge theory of finite groups on oriented two dimensional lattices. Here we construct analogous models with the gauge fields belonging to groupoids, which are categories where every morphism has an…

Quantum Physics · Physics 2022-12-05 Pramod Padmanabhan , Indrajit Jana

An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…

Group Theory · Mathematics 2018-08-24 João Araújo , Peter J. Cameron , Carlo Casolo , Francesco Matucci

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

We analyze a new group testing scheme, termed semi-quantitative group testing, which may be viewed as a concatenation of an adder channel and a discrete quantizer. Our focus is on non-uniform quantizers with arbitrary thresholds. For the…

Information Theory · Computer Science 2015-06-26 Amin Emad , Olgica Milenkovic

We consider the symmetry group of a $Z_2Z_4$-linear code with parameters of a $1$-perfect, extended $1$-perfect, or Preparata-like code. We show that, provided the code length is greater than $16$, this group consists only of symmetries…

Information Theory · Computer Science 2017-03-01 Denis Krotov

Let $G_{(m,3,r)}=\langle x,y\mid x^m=1, y^3=1,yx=x^ry\rangle$ be a metacyclic group of order $3m$, where ${\rm gcd}(m,r)=1$, $1<r<m$ and $r^3\equiv 1$ (mod $m$). Then left ideals of the group algebra $\mathbb{F}_q[G_{(m,3,r)}]$ are called…

Information Theory · Computer Science 2016-06-17 Cao Yonglin , Cao Yuan , Fu Fang-Wei , Gao Jian

Affine-invariant codes have attracted considerable attention due to their rich algebraic structure and strong theoretical properties. In this paper, we study a family of affine-invariant codes whose defining set consists of all descendants…

Information Theory · Computer Science 2026-04-01 Xiongkun Zheng , Dabin Zheng , Xiaoqiang Wang , Mu Yuan

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 2021-02-23 Junyang Zhang , Sanming Zhou

We construct two new infinite families of trace codes of dimension $2m$, over the ring $\mathbb{F}_p+u\mathbb{F}_p,$ when $p$ is an odd prime. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by…

Information Theory · Computer Science 2017-09-18 Minjia Shi , Yue Guan , Patrick Sole

Recently it was proved that if a linear code is invariant under the action of a doubly transitive permutation group, it achieves the capacity of erasure channel. Therefore, it is of sufficient interest to classify all codes, invariant under…

Information Theory · Computer Science 2020-10-30 Kirill Ivanov , Rüdiger L. Urbanke

Let K be a cyclic Galois extension of degree f over k and T a generator of the Galois group. For any v=(v_1,... , v_m)\in K^m such that v is linearly independent over k, and any 0< d < m the Gabidulin-like code C(v, T , d) is a maximum rank…

Information Theory · Computer Science 2016-04-01 Dirk Liebhold , Gabriele Nebe

We study affine Jacobi structures on an affine bundle $\pi:A\to M$, i.e. Jacobi brackets that close on affine functions. We prove that there is a one-to-one correspondence between affine Jacobi structures on $A$ and Lie algebroid structures…

Differential Geometry · Mathematics 2007-05-23 J. Grabowski , D. Iglesias , J. C. Marrero , E. Padrón , P. Urbański

An orbit polytope is the convex hull of an orbit under a finite group $G \leq \operatorname{GL}(d,\mathbb{R})$. We develop a general theory of possible affine symmetry groups of orbit polytopes. For every group, we define an open and dense…

Metric Geometry · Mathematics 2015-11-30 Erik Friese , Frieder Ladisch
‹ Prev 1 4 5 6 7 8 10 Next ›