Related papers: List decoding group homomorphisms between supersol…

Locally recoverable codes were introduced by Gopalan et al. in 2012, and in the same year Prakash et al. introduced the concept of codes with locality, which are a type of locally recoverable codes. In this work we introduce a new family of…

We study uniquely decodable codes and list decodable codes in the high-noise regime, specifically codes that are uniquely decodable from $\frac{1-\varepsilon}{2}$ fraction of errors and list decodable from $1-\varepsilon$ fraction of…

Among other things, we prove that the group of automorphisms fixing every normal subgroup of a nilpotent-by-abelian group is nilpotent-by-metabelian. In particular, the group of automorphisms fixing every normal subgroup of a metabelian…

Motivated by the Bruhat and Cartan decompositions of general linear groups over local fields, double cosets of the group of label preserving automorphisms of a label-regular tree over the fixator of an end of the tree and over maximal…

This article is concerned with the study of the holonomy group of flat solvmanifolds. It is known that the holonomy group of a flat solvmanifold is abelian; we give an elementary proof of this fact and moreover we prove that any finite…

Let $G$ be a solvable subgroup of the group $\diff{}{n}$ of local complex analytic diffeomorphisms. Analogously as for groups of matrices we bound the solvable length of $G$ by a function of $n$. Moreover we provide the best possible bounds…

An index code is said to be locally decodable if each receiver can decode its demand using its side information and by querying only a subset of the transmitted codeword symbols instead of observing the entire codeword. Local decodability…

It is proved that every group of the form $G=AB$ with two subgroups $A$ and $B$ each of which is either abelian or has a quasicyclic subgroup of index $2$ is soluble of derived length at most $3$. In particular, if $A$ is abelian and $B$ is…

A new method for the construction of the binary quantum stabilizer codes is provided, where the construction is based on Abelian and non-Abelian groups association schemes. The association schemes based on non-Abelian groups are constructed…

In this paper, we introduce the notions of matching matrices in groups and vector spaces, which lead to some necessary conditions for existence of acyclic matching in abelian groups and its linear analogue. We also study the linear local…

A group homomorphism eta:H-->G is called a localization of H if every homomorphism phi:H-->G can be `extended uniquely' to a homomorphism Phi:G-->G in the sense that Phi eta=phi. Libman showed that a localization of a finite group need not…

Let $\mathbb{U}$ be a Banach Lie group and $S\subseteq \mathbb{U}$ an ad-bounded subset thereof, in the sense that there is a uniform bound on the adjoint operators induced by elements of $S$ on the Lie algebra of $\mathbb{U}$. We prove…

It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…

We present an explicit and efficient algebraic construction of capacity-achieving list decodable codes with both constant alphabet and constant list sizes. More specifically, for any $R \in (0,1)$ and $\epsilon>0$, we give an algebraic…

We show the existence of an absolute constant $\alpha>0$ such that, for every $k \geq 3$, $G:=\mathop{\mathrm{Sym}}(k)$, and for every $H \leqslant G$ of index at least $3$, one has $|H/[H,H]| \leq |G:H|^{\alpha/ \log \log |G:H|}$. This…

We show that locally repairable codes (LRCs) can be list decoded efficiently beyond the Johnson radius for a large range of parameters by utilizing the local error correction capabilities. The new decoding radius is derived and the…

Moss\'e proved that primitive morphisms are recognizable. In this paper we give a computable upper bound for the constant of recognizability of such a morphism. This bound can be expressed only using the cardinality of the alphabet and the…

This paper aims at studying solvable-by-finite and locally solvable maximal subgroups of an almost subnormal subgroup of the general skew linear group $\GL_n(D)$ over a division ring $D$. It turns out that in the case where $D$ is…

A group homomorphism eta:A-> H is called a localization of A if every homomorphism phi:A-> H can be `extended uniquely' to a homomorphism Phi:H-> H in the sense that Phi eta = phi. This categorical concepts, obviously not depending on the…

Error-correcting codes are one of the most fundamental objects in pseudorandomness, with applications in communication, complexity theory, and beyond. Codes are useful because of their ability to support decoding, which is the task of…