| Paper ID | D6-S3-T4.2 |
| Paper Title |
Perfect Binary Codes Capable of Correcting Equal Multiple Deletions |
| Authors |
Kento NAKADA, Okayama University, Japan |
| Session |
D6-S3-T4: Multiple Insertion/Deletion-Correcting Codes |
| Chaired Session: |
Monday, 19 July, 22:40 - 23:00 |
| Engagement Session: |
Monday, 19 July, 23:00 - 23:20 |
| Abstract |
This paper proposes new perfect codes $ \Code{(r,t)}{a}{n} $, capable of correcting multiple deletion of type $ \sigma $, which is containing special classes --- almost consecutively equal (ACE for short) $t$-tuple deletions and almost splitly equal (ASE for short) $t$-tuple deletions.
|
