Bounds on the Essential Covering Radius of Constrained Systems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Motivated by applications for error-correcting constrained codes, we study the essential covering radius of constrained systems. In a recent work, the essential covering radius was suggested as new fundamental parameter of constrained systems that characterizes the error-correction capabilities of the quantized-constraint concatenation (QCC) scheme. We provide general efficiently computable upper-bounds on the essential covering radius using Markov chains and sliding-block codes, which in some cases, we show to be tight.

Original languageAmerican English
Title of host publication2023 IEEE International Symposium on Information Theory, ISIT 2023
Pages2679-2684
Number of pages6
ISBN (Electronic)9781665475549
DOIs
StatePublished - 1 Jan 2023
Event2023 IEEE International Symposium on Information Theory, ISIT 2023 - Taipei, Taiwan, Province of China
Duration: 25 Jun 202330 Jun 2023

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2023-June

Conference

Conference2023 IEEE International Symposium on Information Theory, ISIT 2023
Country/TerritoryTaiwan, Province of China
CityTaipei
Period25/06/2330/06/23

All Science Journal Classification (ASJC) codes

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

Fingerprint

Dive into the research topics of 'Bounds on the Essential Covering Radius of Constrained Systems'. Together they form a unique fingerprint.

Cite this