Perfect Codes for Generalized Deletions from Minuscule Elements of Weyl Groups
Manabu Hagiwara

TL;DR
This paper explores the relationship between insertion/deletion codes and minuscule elements of Weyl groups, providing new insights into coding theory through algebraic structures.
Contribution
It establishes a novel connection between ID codes and minuscule Weyl group elements, advancing the theoretical understanding of code construction.
Findings
Identifies a correspondence between ID codes and minuscule Weyl group elements
Provides a framework for constructing perfect codes using algebraic structures
Enhances the theoretical foundation of deletion-correcting codes
Abstract
This paper discusses a connection between insertion/deletion (ID) codes and minuscule elements of Weyl groups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDNA and Biological Computing · Coding theory and cryptography · Cellular Automata and Applications
