相关论文: Construction of Minimal Tail-Biting Trellises for …
Group network codes are a generalization of linear codes that have seen several studies over the last decade. When studying network codes, operations performed at internal network nodes called local encoding functions, are of significant…
In this paper, the cyclic codes of length $n$, where $n$ is odd with certain restrictions, over a finite chain ring $R$, have been studied using the structure of group algebra approach. The primitive idempotents of $RG$ of a finite cyclic…
The algebraic structure of the group generated by the encryption functions of a block cipher depends on the key schedule algorithm used for generating the round keys. For such a reason, in general, studying this group does not appear to be…
A structure theorem of the group codes which are relative projective for the subgroup $\lbrace 1 \rbrace$ of $G$ is given. With this, we show that all such relative projective group codes in a fixed group algebra $RG$ are in bijection to…
We study Artin-Tits braid groups $\mathbb{B}_W$ of type ADE via the action of $\mathbb{B}_W$ on the homotopy category $\mathcal{K}$ of graded projective zigzag modules (which categorifies the action of the Weyl group $W$ on the root…
In this paper a wide family of identifying codes over regular Cayley graphs of degree four which are built over finite Abelian groups is presented. Some of the codes in this construction are also perfect. The graphs considered include some…
We give a complete list of orbit codes that are generated by an irreducible cyclic group, i.e. an irreducible group having one generator. We derive some of the basic properties of these codes such as the cardinality and the minimum…
Below we construct non-cyclic and torsion-free abelian quotients for subgroups of braid groups generated by cube powers of half-twists. In the case of 3 and 4 strands we compute the abelianization of these groups. Also, we get…
The multidimensional convolutional codes are an extension of the notion of convolutional codes (CCs) to several dimensions of time. This paper explores the class of two-dimensional convolutional codes (2D CCs) and 2D tail-biting…
Trellises play an important theoretical and practical role for classical codes. Their main utility is to devise complexity-efficient error estimation algorithms. Here, we describe trellis representations for quantum stabilizer codes. We…
It is well known that the discrete analogue of a lattice is a linear code which is a vector subspace of Hamming space $\mathbb{F}^n$. The set $\mathbb{F}$ is a finite field and $n \in \mathbb{Z}_{>0}$. Our attempt is to construct a class of…
When we consider a finite abelian group acting linearly on a polynomial ring, we can find monomial generators for the subring of invariants. By Noether's degree bound and Hilbert's finiteness theorem, we know that there are finitely many…
In this paper, we discuss certain circumstances in which the category of tame functors inherits an abelian category structure with minimal resolutions and a model category structure with minimal cofibrant replacements. We also present a…
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 study the positive theory of groups acting on trees and show that under the presence of weak small cancellation elements, the positive theory of the group is trivial, i.e. coincides with the positive theory of a non-abelian free group.…
Self-dual and complementary dual cyclic/abelian codes over finite fields form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, abelian codes…
The non-local interactions in several quantum device architectures allow for the realization of more compact quantum encodings while retaining the same degree of protection against noise. Anticipating that short to medium-length codes will…
We continue in this paper the study of locally minimal groups started in \cite{LocMin}. The minimality criterion for dense subgroups of compact groups is extended to local minimality. Using this criterion we characterize the compact abelian…
The paper presents a comprehensive study of group codes from non-abelian split metacyclic group algebras. We derive an explicit Wedderburn-like decomposition of finite split metacyclic group algebras over fields with characteristic coprime…
In this paper we bring together results about the density of subsemigroups of abelian Lie groups, the minimal number of topological generators of abelian Lie groups and a result about actions of algebraic groups. We find the minimal number…