Related papers: Asymptotically Good Codes Over Non-Abelian Groups

Let $G$ be a finite abelian group. Ferraz, Guerreiro and Polcino Milies prove that the number of $G$-equivalence classes of minimal abelian codes is equal to the number of $G$-isomorphism classes of subgroups for which corresponding…

Codebooks are required to have small inner-product correlation in many practical applications, such as direct spread code division multiple access communications, space-time codes and compressed sensing. In general, it is difficult to…

In an abelian group G, a more sums than differences (MSTD) set is a subset A of G such that |A+A|>|A-A|. We provide asymptotics for the number of MSTD sets in finite abelian groups, extending previous results of Nathanson. The proof…

Let A be an abelian surface over F_q, the field of q elements. The rational points on A/\F_q form an abelian group A(\F_q) \simeq \Z/n_1\Z \times \Z/n_1 n_2 \Z \times \Z/n_1 n_2 n_3\Z \times\Z/n_1 n_2 n_3 n_4\Z. We are interested in knowing…

We show that every self-orthogonal code over $\mathbb F_q$ of length $n$ can be extended to a self-dual code, if there exists self-dual codes of length $n$. Using a family of Galois towers of algebraic function fields we show that over any…

Motivated by applications in spatial genomics, we revisit group testing (Dorfman~1943) and propose the class of $\lambda$-{\sf ADD}-codes, studying such codes with certain distance $d$ and codelength $n$. When $d$ is constant, we provide…

It is well known that quantum computers can efficiently find a hidden subgroup $H$ of a finite Abelian group $G$. This implies that after only a polynomial (in $\log |G|$) number of calls to the oracle function, the states corresponding to…

We present a series of examples of precompact, noncompact, reflexive topological Abelian groups. Some of them are pseudocompact or even countably compact, but we show that there exist precompact non-pseudocompact reflexive groups as well.…

We deal with some pcf investigations mostly motivated by abelian group theory problems and deal their applications to test problems (we expect reasonably wide applications). We prove almost always the existence of aleph_omega-free abelian…

We provide an algebraic characterization of strong ordered Abelian groups: An ordered Abelian group is strong iff it has bounded regular rank and almost finite dimension. Moreover, we show that any strong ordered Abelian group has finite…

We determine the structure of a finite subset $A$ of an abelian group given that $|2A|<3(1-\epsilon)|A|$, $\epsilon>0$; namely, we show that $A$ is contained either in a "small" one-dimensional coset progression, or in a union of fewer than…

We consider binary abelian codes of length $p^m q^n$, where $p$ and $q$ are prime rational integers under some restrictive hypotheses. In this case, we determine the idempotents generating minimal codes and either the respective weights or…

We study the non-abelian tensor square $G\otimes G$ for the class of groups G that are finitely generated modulo their derived subgroup. In particular, we find conditions on G/G' so that $G\otimes G$ is isomorphic to the direct product of…

The additive codes may have better parameters than linear codes. However, it is still a challenging problem to efficiently construct additive codes that outperform linear codes, especially those with greater distances than linear codes of…

An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group.…

A new ensemble of structured codes is introduced. These codes are called Quasi Linear Codes (QLC). The QLC's are constructed by taking subsets of linear codes. They have a looser structure compared to linear codes and are not closed under…

A method for construction of polar subcodes is presented, which aims on minimization of the number of low-weight codewords in the obtained codes, as well as on improved performance under list or sequential decoding. Simulation results are…

We propose constructions of codes over quotient rings of Eisenstein integers equipped with the Euclidean, square Euclidean, and hexagonal distances as a generalization of codes over Eisenstein integer fields. By set partitioning, we…

In this article we discuss some applications of the construction of the Ap\'ery set of a good semigroup in $\mathbb{N}^d$ given in the previous paper [Partition of the complement of good semigroup ideals and Ap\'ery sets, Communications in…

We construct maximally recoverable codes (corresponding to partial MDS codes) which are based on linearized Reed-Solomon codes. The new codes have a smaller field size requirement compared with known constructions. For certain asymptotic…