Related papers: Spread Codes from Abelian non-cyclic groups

A group code structure of a linear code is a description of the code as one-sided or two-sided ideal of a group algebra of a finite group. In these realizations, the group algebra is identified with the ambient space, and the group elements…

In this paper, we give a recipe for producing infinitely many non-divisible codimension $2$ cycles on a product of two or more very general Abelian varieties. In the process, we introduce the notion of "field of definition" for cycles in…

Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…

It is well known that constructing codes with good parameters is one of the most important and fundamental problems in coding theory. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes…

We show that non-Abelian anyons can emerge from an Abelian topologically ordered system subject to local time-periodic driving. This is illustrated with the toric-code model, as the canonical representative of a broad class of Abelian…

We define certain extensions of Jacobi groups of $A_n$, prove an analogue of Chevalley Theorem for their invariants, and construct a Dubrovin Frobenius structure on it orbit space.

Spread codes and cyclic orbit codes are special families of constant dimension subspace codes. These codes have been well-studied for their error correction capability, transmission rate and decoding methods, but the question of how to…

In this paper, we construct the first families of asymmetric quantum convolutional codes (AQCC)'s. These new AQCC's are constructed by means of the CSS-type construction applied to suitable families of classical convolutional codes, which…

A set of quasi-uniform random variables $X_1,...,X_n$ may be generated from a finite group $G$ and $n$ of its subgroups, with the corresponding entropic vector depending on the subgroup structure of $G$. It is known that the set of entropic…

This article begins with an exploration of nonlinear codes ($\mathbb{F}_q$-linear subspaces of $\mathbb{F}_{q^m}^n$) which are generalizations of the familiar Reed-Solomon codes. This then leads to a wider exploration of nonlinear analogues…

We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…

In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…

Quasi-cyclic codes form an important class of algebraic codes that includes cyclic codes as a special subclass. This chapter focuses on the algebraic structure of quasi-cyclic codes, first. Based on these structural properties, some…

Sum-rank metric codes, as a generalization of Hamming codes and rank metric codes, have important applications in fields such as multi-shot linear network coding, space-time coding and distributed storage systems. The purpose of this study…

We show, using acylindrical hyperbolicity, that a finitely generated group splitting over $\Z$ cannot be simple. We also obtain SQ-universality in most cases, for instance a balanced group (one where if two powers of an infinite order…

Algorithms to construct minimal left group codes are provided. These are based on results describing a complete set of orthogonal primitive idempotents in each Wedderburn component of a semisimple finite group algebra FG for a large class…

Let $q$ be a prime power and let $\mathcal{R}=\mathbb{F}_{q}[u_1,u_2, \cdots, u_k]/\langle f_i(u_i),u_iu_j-u_ju_i\rangle$ be a finite non-chain ring, where $f_i(u_i), 1\leq i \leq k$ are polynomials, not all linear, which split into…

Most well-known constructions of $(N \times n, q^{Nk}, d)$ maximum rank distance (MRD) codes rely on the arithmetic of $\mathbb{F}_{q^N}$, whose increasing complexity with larger $N$ hinders parameter selection and practical implementation.…

Circuit codes are constructed from induced cycles in the graph of the $n$ dimensional hypercube. They are both theoretically and practically important, as circuit codes can be used as error correcting codes. When constructing circuit codes,…

Let $\mathbb{F}_q$ be a finite field of cardinality $q$, where $q$ is a power of a prime number $p$, $t\geq 2$ an even number satisfying $t \not\equiv 1 \;(\bmod \;p)$ and $\mathbb{F}_{q^t}$ an extension field of $\mathbb{F}_q$ with degree…