TY - GEN
T1 - Bounds on the Essential Covering Radius of Constrained Systems
AU - Elimelech, Dor
AU - Meyerovitch, Tom
AU - Schwartz, Moshe
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023/1/1
Y1 - 2023/1/1
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/85171453569
U2 - 10.1109/ISIT54713.2023.10206920
DO - 10.1109/ISIT54713.2023.10206920
M3 - Conference contribution
AN - SCOPUS:85171453569
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2679
EP - 2684
BT - 2023 IEEE International Symposium on Information Theory, ISIT 2023
PB - Institute of Electrical and Electronics Engineers
T2 - 2023 IEEE International Symposium on Information Theory, ISIT 2023
Y2 - 25 June 2023 through 30 June 2023
ER -