Perfect Binary Codes Capable of Correcting Equal Multiple Deletions

Kento Nakada

doi:10.1109/ISIT45174.2021.9517840

Perfect Binary Codes Capable of Correcting Equal Multiple Deletions

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This paper proposes new perfect codes Ca(r,t) (n), capable of correcting multiple deletion of type σ, which is containing special classes - almost consecutively equal (ACE for short) t-tuple deletions and almost splitly equal (ASE for short) t-tuple deletions.

Original language	English
Title of host publication	2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2661-2665
Number of pages	5
ISBN (Electronic)	9781538682098
DOIs	https://doi.org/10.1109/ISIT45174.2021.9517840
Publication status	Published - Jul 12 2021
Event	2021 IEEE International Symposium on Information Theory, ISIT 2021 - Virtual, Melbourne, Australia Duration: Jul 12 2021 → Jul 20 2021

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2021-July
ISSN (Print)	2157-8095

Conference

Conference	2021 IEEE International Symposium on Information Theory, ISIT 2021
Country/Territory	Australia
City	Virtual, Melbourne
Period	7/12/21 → 7/20/21

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT45174.2021.9517840

Cite this

Nakada, K. (2021). Perfect Binary Codes Capable of Correcting Equal Multiple Deletions. In 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings (pp. 2661-2665). (IEEE International Symposium on Information Theory - Proceedings; Vol. 2021-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT45174.2021.9517840

Perfect Binary Codes Capable of Correcting Equal Multiple Deletions. / Nakada, Kento.
2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2021. p. 2661-2665 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2021-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Nakada, K 2021, Perfect Binary Codes Capable of Correcting Equal Multiple Deletions. in 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings. IEEE International Symposium on Information Theory - Proceedings, vol. 2021-July, Institute of Electrical and Electronics Engineers Inc., pp. 2661-2665, 2021 IEEE International Symposium on Information Theory, ISIT 2021, Virtual, Melbourne, Australia, 7/12/21. https://doi.org/10.1109/ISIT45174.2021.9517840

@inproceedings{a68048feac8a48e786d604331745474a,

title = "Perfect Binary Codes Capable of Correcting Equal Multiple Deletions",

abstract = "This paper proposes new perfect codes Ca(r,t) (n), capable of correcting multiple deletion of type σ, which is containing special classes - almost consecutively equal (ACE for short) t-tuple deletions and almost splitly equal (ASE for short) t-tuple deletions. ",

author = "Kento Nakada",

note = "Funding Information: ACKNOWLEDGMENT The author would like to thank Dr. Hagiwara for his comments and suggestions. This paper is partially supported by KAKENHI 18H01435. Publisher Copyright: {\textcopyright} 2021 IEEE.; 2021 IEEE International Symposium on Information Theory, ISIT 2021 ; Conference date: 12-07-2021 Through 20-07-2021",

year = "2021",

month = jul,

day = "12",

doi = "10.1109/ISIT45174.2021.9517840",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "2661--2665",

booktitle = "2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings",

}

TY - GEN

T1 - Perfect Binary Codes Capable of Correcting Equal Multiple Deletions

AU - Nakada, Kento

N1 - Funding Information: ACKNOWLEDGMENT The author would like to thank Dr. Hagiwara for his comments and suggestions. This paper is partially supported by KAKENHI 18H01435. Publisher Copyright: © 2021 IEEE.

PY - 2021/7/12

Y1 - 2021/7/12

N2 - This paper proposes new perfect codes Ca(r,t) (n), capable of correcting multiple deletion of type σ, which is containing special classes - almost consecutively equal (ACE for short) t-tuple deletions and almost splitly equal (ASE for short) t-tuple deletions.

AB - This paper proposes new perfect codes Ca(r,t) (n), capable of correcting multiple deletion of type σ, which is containing special classes - almost consecutively equal (ACE for short) t-tuple deletions and almost splitly equal (ASE for short) t-tuple deletions.

UR - http://www.scopus.com/inward/record.url?scp=85115073954&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85115073954&partnerID=8YFLogxK

U2 - 10.1109/ISIT45174.2021.9517840

DO - 10.1109/ISIT45174.2021.9517840

M3 - Conference contribution

AN - SCOPUS:85115073954

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2661

EP - 2665

BT - 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2021 IEEE International Symposium on Information Theory, ISIT 2021

Y2 - 12 July 2021 through 20 July 2021

ER -

Perfect Binary Codes Capable of Correcting Equal Multiple Deletions

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this