Related papers: Block components of generalized quaternion group c…

In this article, we introduce and study the concept of the exponent of a cyclic code over a finite field $\mathbb{F}_q.$ We give a relation between the exponent of a cyclic code and its dual code. Finally, we introduce and determine the…

Generalized quasi-cyclic (GQC) codes form a wide and useful class of linear codes that includes thoroughly quasi-cyclic codes, finite geometry (FG) low density parity check (LDPC) codes, and Hermitian codes. Although it is known that the…

In this paper we generalize the notion of low-rank parity check (LRPC) codes by introducing a bilinear product over F^m q based on a generic 3-tensor in Fq^mxmxm, where Fq is the finite field with q elements. The generalized LRPC codes are…

We present a general framework for the construction of quantum tensor product codes (QTPC). In a classical tensor product code (TPC), its parity check matrix is con- structed via the tensor product of parity check matrices of the two…

Let $\mathcal G\simeq H\rtimes\Gamma$ be the semidirect product of a finite group $H$ and $\Gamma\simeq\mathbb Z_p$. Let $F/\mathbb Q_p$ be a finite extension with ring of integers $\mathcal O_F$. Then the total ring of quotients $\mathcal…

A binary linear code $C$ is a $\mathbb{Z}_2$-double cyclic code if the set of coordinates can be partitioned into two subsets such that any cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be…

Split group codes are a class of group algebra codes over an abelian group. They were introduced in 2000 by Ding, Kohel and Ling as a generalization of the cyclic duadic codes. For a prime power q and an abelian group G of order n such that…

We study the decoding problem for quantum Tanner codes and propose to exploit the underlying local code structure by grouping check nodes into more powerful generalized check nodes for enhanced iterative belief propagation (BP) decoding by…

In this work, we present a generalization of the recently proposed quantum Tanner codes by Leverrier and Z\'emor, which contains a construction of asymptotically good quantum LDPC codes. Quantum Tanner codes have so far been constructed…

We investigate additive cyclic codes over the alphabet $\mathbb{F}_{q}\mathbb{F}_{q^2}$, where $q$ is a prime power. First, its generator polynomials and minimal spanning set are determined. Then, examples of $\mathbb{F}_{q^2}$-additive…

Codes considered as structures within unit schemes greatly extends the availability of linear block and convolutional codes and allows the construction of these codes to required length, rate, distance and type. Properties of a code emanate…

The ring in the title is the first non commutative ring to have been used as alphabet for block codes. The original motivation was the construction of some quaternionic modular lattices from codes. The new application is the construction of…

For a block B of a finite group G there are well-known orthogonality relations for the generalized decomposition numbers. We refine these relations by expressing the generalized decomposition numbers with respect to an integral basis of a…

A cyclic subgroup $N$ of a finite group $G$ is called a uni-width subgroup of $G$ if $N$ is the unique cyclic subgroup of $G$ of order $|N|$. In this article, we prove that a finite group $G$ admits a unique largest uni-width subgroup…

In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…

During the past three decades fundamental progress has been made on constructing large torsion-free subgroups (i.e. subgroups of finite index) of the unit group $\U (\Z G)$ of the integral group ring $\Z G$ of a finite group $G$. These…

This paper classifies the derivations of group algebras in terms of the generators and defining relations of the group. If $RG$ is a group ring, where $R$ is commutative and $S$ is a set of generators of $G$ then necessary and sufficient…

The correlators of Wilson-line operators in non-abelian gauge theories are known to exponentiate, and their logarithms can be organised in terms of the collections of Feynman diagrams called Cwebs. The colour factors that appear in the…

In this article, we present a combinatorial formula for computing the Wedderburn decomposition of the rational group algebra associated with an ordinary metacyclic $p$-group $G$, where $p$ is any prime. We also provide a formula for…

In this article, we derive explicit combinatorial formulas, depending only on $q$, for the Wedderburn decomposition of the rational group algebras of the finite linear groups $\operatorname{SL}_2(q)$ and $\operatorname{PSL}_2(q)$.…