Weight Enumerators of Some Classes of Deletion Correcting Codes

Khodakhast Bibak, Olgica Milenkovic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We derive an explicit expression for the weight enumerator of a general class of codes which includes several classes of deletion correcting codes, such as Helberg, Levenshtein, and Shifted Varshamov- Tenengolts codes, as special cases. Our approach generalizes the number-theoretic methods previously used for evaluating the size of single deletion correcting codes, and also leads to a new explicit formula for the number of binary solutions of an arbitrary linear congruence which might be also of independent interest.

Original languageEnglish (US)
Title of host publication2018 IEEE International Symposium on Information Theory, ISIT 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages431-435
Number of pages5
ISBN (Print)9781538647806
DOIs
StatePublished - Aug 15 2018
Event2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States
Duration: Jun 17 2018Jun 22 2018

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2018-June
ISSN (Print)2157-8095

Other

Other2018 IEEE International Symposium on Information Theory, ISIT 2018
CountryUnited States
CityVail
Period6/17/186/22/18

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Weight Enumerators of Some Classes of Deletion Correcting Codes'. Together they form a unique fingerprint.

Cite this