Related papers: List decoding group homomorphisms between supersol…
We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for group isomorphism has withstood all attacks --- even for the…
Kazhdan constants of discrete groups are hard to compute and the actual constants are known only for several classes of groups. By solving a semidefinite programming problem by a computer, we obtain a lower bound of the Kazhdan constant of…
We show how Gabidulin codes can be list decoded by using a parametrization approach. For this we consider a certain module in the ring of linearized polynomials and find a minimal basis for this module using the Euclidean algorithm with…
Affine difference algebraic groups are a generalization of affine algebraic groups obtained by replacing algebraic equations with algebraic difference equations. We show that the isomorphism theorems from abstract group theory have…
The key step of syndrome-based decoding of Reed-Solomon codes up to half the minimum distance is to solve the so-called Key Equation. List decoding algorithms, capable of decoding beyond half the minimum distance, are based on interpolation…
In this paper, we employ group rings and automorphism groups of binary linear codes to construct new record-breaking binary linear codes. We consider the semidirect product of abelian groups and cyclic groups and use these groups to…
The list decoding problem for a code asks for the maximal radius up to which any ball of that radius contains only a constant number of codewords. The list decoding radius is not well understood even for well studied codes, like…
v2: An additional assumption was added in Theorem 4.8. In order to show that a connected abelian group is admissible on the site of locally compact spaces we must in addition assume that it is locally topologically divisible. This condition…
In this work, we show new and improved error-correcting properties of folded Reed-Solomon codes and multiplicity codes. Both of these families of codes are based on polynomials over finite fields, and both have been the sources of recent…
We introduce a novel family of expander-based error correcting codes. These codes can be sampled with randomness linear in the block-length, and achieve list-decoding capacity (among other local properties). Our expander-based codes can be…
Hrushovski proved the Lie model theorem in full generality with model theoretic methods. The theorem states that for every approximate group there exists a generalized definable locally compact model, which, simplifying, is a…
The paper is devoted to homology groups of cubical sets with coefficients in contravariant systems of Abelian groups. The study is based on the proof of the assertion that the homology groups of the category of cubes with coefficients in…
It is well known that a random q-ary code of rate \Omega(\epsilon^2) is list decodable up to radius (1 - 1/q - \epsilon) with list sizes on the order of 1/\epsilon^2, with probability 1 - o(1). However, until recently, a similar statement…
We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…
We prove that the compressed word problem in a group that is hyperbolic relative to a collection of free abelian subgroups is solvable in polynomial time.
We prove that for finitely generated abelian groups $A$ and $B$, the space of $\mathbb{E}_\infty$-ring maps between the spherical groups rings $\mathbb{S}[A] \to \mathbb{S}[B]$ is equivalent to the discrete set of group homomorphisms $A \to…
A subspace Y of a separable metrizable space X is separable, but without X metrizable this is not true even If Y is a closed linear subspace of a topological vector space X. K.H. Hofmann and S.A. Morris introduced the class of pro-Lie…
We develop a method for measuring and localizing homology classes. This involves two problems. First, we define relevant notions of size for both a homology class and a homology group basis, using ideas from relative homology. Second, we…
List-decodability of Reed-Solomon codes has received a lot of attention, but the best-possible dependence between the parameters is still not well-understood. In this work, we focus on the case where the list-decoding radius is of the form…
Linearized Reed-Solomon (LRS) codes are sum-rank metric codes that fulfill the Singleton bound with equality. In the two extreme cases of the sum-rank metric, they coincide with Reed-Solomon codes (Hamming metric) and Gabidulin codes (rank…