Related papers: Perfect Codes for Generalized Deletions from Minus…
In this work, we study linear error-correcting codes against adversarial insertion-deletion (indel) errors. While most constructions for the indel model are nonlinear, linear codes offer compact representations, efficient encoding, and…
We consider the problem of constructing codes that can correct $\delta$ deletions occurring in an arbitrary binary string of length $n$ bits. Varshamov-Tenengolts (VT) codes, dating back to 1965, are zero-error single deletion $(\delta=1)$…
We present a method of constructing discrete integrable systems with crystallographic reflection group (Weyl) symmetries, thus clarifying the relationship between different discrete integrable systems in terms of their symmetry groups.…
We develop a reduction procedure which provides an equivalence (as highest weight categories) from an arbitrary block (defined in terms of the central character and the integral Weyl group) of the BGG category O for a general linear Lie…
In recent years, the emergence of DNA storage systems has led to a widespread focus on the research of codes correcting insertions, deletions, and classic substitutions. During the initial investigation, Levenshtein discovered the VT codes…
The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and…
In this paper we study periodicity phenomena for modular extensions between Weyl modules and between Weyl and simple modules of the general linear group that are associated to adding a power of the characteristic to the first parts of the…
We examine sets of codes such that certain properties are invariant under the choice of oracle from a range of possible oracles and establish a connection between such codes and Medvedev reductions. In examing the complexity of such sets of…
Perfect code in Cayley graphs and Cayley sum graphs is studied extensively in recent years. In this paper, we consider perfect code in generalized Cayley graphs.
We consider the problem of constructing codes that can correct $\delta$ deletions occurring in an arbitrary binary string of length $n$ bits. Varshamov-Tenengolts (VT) codes can correct all possible single deletions $(\delta=1)$ with an…
We obtain a new coding and decoding method using the generalized Pell $(p,i)$ -numbers. The relations among the code matrix elements, error detection and correction have been established for this coding theory. We give two new blocking…
This paper studies on the cardinality of perfect multi deletion binary codes. The lower bound for any perfect deletion code with the fixed code length and the number of deletions, and the asymptotic achievable of Levenshtein's upper bound…
One peculiarity with deletion-correcting codes is that perfect $t$-deletion-correcting codes of the same length over the same alphabet can have different numbers of codewords, because the balls of radius $t$ with respect to the…
We study codes that can detect the exact number of deletions and insertions in concatenated binary strings. We construct optimal codes for the case of detecting up to $\del$ deletions. We prove the optimality of these codes by deriving a…
Insertion-deletion codes (insdel codes for short) are used for correcting synchronization errors in communications, and in other many interesting fields such as DNA storage, date analysis, race-track memory error correction and language…
We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…
In this paper, we give a new approach for the study of Weyl-type theorems. Precisely we introduce the concepts of spectral valued and spectral partitioning functions. Using two natural order relations on the set of spectral valued…
We establish a necessary and sufficient condition for a normal subgroup of a finite group to be a subgroup perfect code.
This manuscript contains tables giving the multiplicities with which irreducible characters of exceptional Weyl groups appear in characters induced from certain reflection subgroups containing maximal parabolic subgroups.
Small cancellation groups form an interesting class with many desirable properties. It is a well-known fact that small cancellation groups are generic; however, all previously known results of their genericity are asymptotic and provide no…