Related papers: Perfect Codes for Generalized Deletions from Minus…
This paper is concerned with the Weyl composition of symbols in large dimension. We specify a class of symbols in order to estimate the Weyl symbol of the product of two Weyl $h-$pseudodifferential operators, with constants independent of…
In the present paper we develop a small cancellation theory for associative algebras with a basis of invertible elements. Namely, we study quotients of a group algebra of a free group and introduce three axioms for the corresponding…
Guess & Check (GC) codes are systematic binary codes that can correct multiple deletions, with high probability. GC codes have logarithmic redundancy in the length of the message $k$, and the encoding and decoding algorithms of these codes…
In the representation theory of split reductive algebraic groups, it is well known that every Weyl module with minuscule highest weight is irreducible over every field. Also, the adjoint representation of $E_8$ is also irreducible over…
This paper gives some theory and efficient design of binary block systematic codes capable of controlling the deletions of the symbol ``$0$'' (referred to as $0$-deletions) and/or the insertions of the symbol ``$0$'' (referred to as…
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 investigate inference of variable-length codes in other domains of computer science, such as noisy information transmission or information retrieval-storage: in such topics, traditionally mostly constant-length codewords act. The study…
The problem of computing the dimension of a left/right ideal in a group algebra F[G] of a finite group G over a field F is considered. The ideal dimension is related to the rank of a matrix originating from a regular left/right…
We introduce a general class of codes which includes several well-known classes of deletion/insertion correcting codes as special cases. For example, the Helberg code, the Levenshtein code, the Varshamov--Tenengolts code, and most variants…
We study substructures of the Weyl group of conformal transformations of the metric of (pseudo)Riemannian manifolds. These substructures are identified by differential constraints on the conformal factors of the transformations which are…
Linear codes with large minimal distances are important error correcting codes in information theory.Orthogonal codes have more applications in the other fields of mathematics. In this paper, we study the binary and ternary orthogonal codes…
This paper gives a brief survey of binary single-deletion-correcting codes. The Varshamov-Tenengolts codes appear to be optimal, but many interesting unsolved problems remain. The connections with shift-register sequences also remain…
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 obtain the Wedderburn-Artin decomposition of a semisimple group algebra associated to a direct product of finite groups. We also provide formulae for the number of all possible group codes, and their dimensions, that can be…
A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A total perfect code in $\Gamma$ is a subset $C$…
This article aims to study some $n$-tuples of elements belonging to a ring $\mathbb{Z}/N\mathbb{Z}$ related to the combinatorics of congruence subgroups of the modular group. More precisely, we will focus here on the notion of minimal…
It is known that there exists an order isomorphism between the Weyl group orbit through a minuscule weight of a simply-laced finite-dimensional simple Lie algebra and the set of all order filters in a self-dual connected d-complete poset.…
We consider the problem of constructing codes that can correct deletions that are localized within a certain part of the codeword that is unknown a priori. Namely, the model that we study is when at most $k$ deletions occur in a window of…
In this paper, we establish a bijection between the infinite reduced words of an affine Weyl group and certain biclosed sets of its positive system and determine all finitely generated biclosed sets in the positive system of an affine Weyl…
In this work, we consider the problem of efficient decoding of codes from insertions and deletions. Most of the known efficient codes are codes with synchronization strings which allow one to reduce the problem of decoding insertions and…