Related papers: On minimal easily computable dimension group algeb…
We show that the group C*-algebra of any elementary amenable group is quasidiagonal. This is an offspring of recent progress in the classification theory of nuclear C*-algebras.
We classify, in terms of the structure of the finite group G, all group algebras KG for which all right ideals are right annihilators of principal left ideals. This means in the language of coding theory that we classify code-checkable…
We sketch the proof of a connection between the canonical (0-)dimension of semisimple split simply connected groups and cohomology of their full flag varieties. Using this connection, we get a new estimate of the canonical (0-)dimension of…
A code is a subset of the vertex set of a Hamming graph. The set of $s$-neighbours of a code is the set of all vertices at Hamming distance $s$ from their nearest codeword. A code $C$ is $s$-elusive if there exists a distinct code $C'$ that…
We establish a lower bound for the representation dimension of all the classical Hecke algebras of types A, B and D. For all the type A algebras, and most of the algebras of types B and D, we also establish upper bounds. Moreover, we…
The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum distance of the code. A constructive proof for reconstructibility of an extended perfect…
In this paper, the complete algebraic structure of finite semisimple group algebra of a normally monomial group is described. The main result is illustrated by computing the explicit Wedderburn decomposition of finite semisimple group…
We prolonge the list of C*-algebras for which all extensions by any stable separable C*-algebra are semi-invertible. In particular, we handle certain amalgamations, both of C*-algebras and of groups. Concerning groups we consider both…
The equational probabilistic spectrum of a finite algebra is the set of probabilities with which equations are satisfied in the algebra. We study algebras with minimal spectrum, that is, spectra consisting only of the values $1$ and…
We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…
Given a hypergraph $\mathcal{H}$, we introduce a new class of evaluation toric codes called edge codes derived from $\mathcal{H}$. We analyze these codes, focusing on determining their basic parameters. We provide estimations for the…
Polycyclic codes offer a natural generalization of cyclic codes and provide a broader algebraic framework for constructing linear codes with good parameters. In this paper, we study binary polycyclic codes associated with powers of…
We prove that, over an algebraically closed field of characteristic zero, a semisimple Hopf algebra that has a nontrivial self-dual simple module must have even dimension. This generalizes a classical result of W. Burnside. As an…
In this paper we study a special subclass of real solvable Lie algebras having small dimensional or small codimensional derived ideal. It is well-known that the derived ideal of any Heisenberg Lie algebra is 1-dimensional and the derived…
We show that a hypersimple unidimensional theory that has a club of reducts, in the partial order of all countable reducts, that are coordinatized in finite rank, is supersimple.
It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…
In this article, we construct linear codes over the commutative non-unital ring $I$ of size four. We obtain their Lee-weight distributions and study their binary Gray images. Under certain mild conditions, these classes of binary codes are…
In this paper, we study definably compact semigroups in o-minimal structures, aiming to extend the theory of definable groups to a broader algebraic setting. We show that any definably compact semigroup contains idempotents and admits 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…
The aim of this work is to give degree formulas for the generalized Hamming weights of evaluation codes and to show lower bounds for these weights. In particular, we give degree formulas for the generalized Hamming weights of…