Related papers: Group convolutional codes

The discrete acyclic convolution computes the 2n-1 sums sum_{i+j=k; (i,j) in [0,1,2,...,n-1]^2} (a_i b_j) in O(n log n) time. By using suitable offsets and setting some of the variables to zero, this method provides a tool to calculate all…

This paper is an attempt to compute the decomposition numbers of the blocks of the symmetric group which have "small defect"; that is, blocks of weight smaller than the characteristic. We present various methods for computing such…

Permutation codes are a class of structured vector quantizers with a computationally-simple encoding procedure based on sorting the scalar components. Using a codebook comprising several permutation codes as subcodes preserves the…

We study (weakly) continuous convolution semigroups of probability measures on a Lie group G or a homogeneous space G/K, where K is a compact subgroup. We show that such a convolution semigroup is the convolution product of its initial…

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…

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

We survey the existing parts of a classification of finite groups generated by orthogonal transformations in a finite-dimensional Euclidean space whose fixed point subspace has codimension one or two and extend it to a complete…

We completely determine all lower-modular elements of the lattice of all semigroup varieties. As a corollary, we show that a lower-modular element of this lattice is modular.

We classify finite groups in which the centralisers of certain non-central elements are soluble. This includes a full structural description of groups whose non-central element centralisers are all soluble, and a reduction theorem for the…

We define a notion of morphism between combinatorial codes, making the class of all combinatorial codes into a category $\mathbf{Code}$. We show that morphisms can be used to remove redundant information from a code, and that morphisms…

We describe two similar but independently-coded computations used to construct a complete catalogue of the transitive groups of degree less than $48$, thereby verifying, unifying and extending the catalogues previously available. From this…

We develop the theory of invariant random fields in vector bundles. The spectral decomposition of an invariant random field in a homogeneous vector bundle generated by an induced representation of a compact connected Lie group $G$ is…

We give a stopping criterion for the enumeration of all conjugacy classes in cocompact triangle groups up to any geometric length. The enumeration is based on an encoding given by P. Dehornoy and T. Pinsky.

This paper contains a classification of countable lower 1-transitive linear orders. The notion of lower 1-transitivity generalises that of 1-transitivity for linear orders, and is essential for the structure theory of 1-transitive trees.…

We consider the projective linear group $\mathrm{PSL}(3,\mathbb{H})$. We have investigated the reversibility problem in this group and use the reversibility to offer an algebraic characterization of the dynamical types of…

We describe the ring of invariants for the finite orthogonal groups in odd dimension and even characteristic acting on the defining representation. We construct a minimal algebra generating set and describe the relations among the…

We classify involutions acting on spherical 3-manifolds up to conjugacy. Our geometric approach provides insights into numerous topological properties of these involutions.

In this paper, we introduce a novel approach for generating random elements of a finite group given a set of generators of that. Our method draws upon combinatorial group theory and automata theory to achieve this objective. Furthermore, we…

Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…