Perfect Codes for Generalized Deletions from Minuscule Elements of Weyl Groups

10/23/2018
by   Manabu Hagiwara, et al.
0

This paper discusses a connection between insertion/deletion (ID) codes and minuscule elements of Weyl groups.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2017

A generalized concatenation construction for q-ary 1-perfect codes

We consider perfect 1-error correcting codes over a finite field with q ...
research
10/13/2019

Perfect Multi Deletion Codes Achieve the Asymptotic Optimality of Code Size

This paper studies on the cardinality of perfect multi deletion binary c...
research
10/30/2014

Tasks that Require, or can Benefit from, Matching Blank Nodes

In various domains and cases, we observe the creation and usage of infor...
research
03/08/2023

Error Correcting Codes From General Linear Groups

The parameters of the AG codes on general linear groups are found. The h...
research
12/07/2022

Multifold 1-perfect codes

A μ-fold (multifold) 1-perfect code in any graph is a set C of vertices ...
research
09/01/2021

Flag codes of maximum distance and constructions using Singer groups

In this paper we study flag codes of maximum distance. We characterize t...
research
11/29/2021

A new Sinkhorn algorithm with Deletion and Insertion operations

This technical report is devoted to the continuous estimation of an epsi...

Please sign up or login with your details

Forgot password? Click here to reset