Related papers: List decoding group homomorphisms between supersol…

Locally repairable codes (LRCs) are a class of codes designed for the local correction of erasures. They have received considerable attention in recent years due to their applications in distributed storage. Most existing results on LRCs do…

In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…

We construct families of locally recoverable codes with availability $t\geq 2$ using fiber products of curves, determine the exact minimum distance of many families, and prove a general theorem for minimum distance of such codes. The paper…

For $n\geq 2$ we consider $(n-1)$-connected closed manifolds of dimension at most $(3n-2)$. We prove that away from a finite set of primes, the $p$-local homotopy groups of $M$ are determined by the dimension of the space of indecomposable…

In this letter we consider the ensemble of codes formed by the serial concatenation of a Hamming code and two accumulate codes. We show that this ensemble is asymptotically good, in the sense that most codes in the ensemble have minimum…

Families of "asymptotically regular" LDPC block code ensembles can be formed by terminating (J,K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles…

The recently introduced polar codes constitute a breakthrough in coding theory due to their capacityachieving property. This goes hand in hand with a quasilinear construction, encoding, and successive cancellation list decoding procedures…

Let $F$ be a group whose abelianization is $\Z^k$, $k\geq 2.$ An element of $F$ is called visible if its image in the abelianization is visible, that is, the greatest common divisor of its coordinates is 1. In this paper we compute three…

The method of range decreasing group homomorphisms can be applied to study various maps between mapping spaces, includin holomorphic maps, group homomorphisms, linear maps, semigroup homomorphisms, Lie algebra homomorphisms and algebra…

We investigate subsets with small sumset in arbitrary abelian groups. For an abelian group $G$ and an $n$-element subset $Y \subseteq G$ we show that if $m \ll s^2/(\log n)^2$, then the number of subsets $A \subseteq Y$ with $|A| = s$ and…

Polar codes have gained significant amount of attention during the past few years and have been selected as a coding scheme for the next generation of mobile broadband standard. Among decoding schemes, successive-cancellation list (SCL)…

We prove that a random linear code over F_q, with probability arbitrarily close to 1, is list decodable at radius (1-1/q-\epsilon) with list size L=O(1/\epsilon^2) and rate R=\Omega_q(\epsilon^2/(log^3(1/\epsilon))). Up to the…

We discuss a Moser type argument to show when a deformation of a Lie group homomorphism and of a Lie subgroup is trivial. For compact groups we obtain stability results.

A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. Making use of linear constraints imposed on the permutation matrices, we can formulate a minimum Euclidian distance decoding…

A binary code is said to be a disjunctive list-decoding $s_L$-code, $s\ge1$, $L\ge1$, (briefly, LD $s_L$-code) if the code is identified by the incidence matrix of a family of finite sets in which the union of any $s$ sets can cover not…

Improving the explainability of the results from machine learning methods has become an important research goal. Here, we study the problem of making clusters more interpretable by extending a recent approach of [Davidson et al., NeurIPS…

We prove new upper bounds on homotopy and homology groups of o-minimal sets in terms of their approximations by compact o-minimal sets. In particular, we improve the known upper bounds on Betti numbers of semialgebraic sets defined by…

In 1979, Miller proved that for a group $G$ of odd order, two minimal group codes in $\mathbb{F}_2G$ are $G$-equivalent if and only they have identical weight distribution. In 2014, Ferraz-Guerreiro-Polcino Milies disprove Miller's result…

For codes equipped with metrics such as Hamming metric, symbol pair metric or cover metric, the Johnson bound guarantees list-decodability of such codes. That is, the Johnson bound provides a lower bound on the list-decoding radius of a…

We show that expander codes, when properly instantiated, are high-rate list recoverable codes with linear-time list recovery algorithms. List recoverable codes have been useful recently in constructing efficiently list-decodable codes, as…