量子约束级联与约束系统的覆盖半径
Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems
摘要:
我们介绍了一种新的框架,用于实现在约束系统中的纠错。我们的计划,称为量化约束级联(QCC)的主要思想,是采用一个过程中嵌入的纠错码的码字在一个受约束的系统作为(噪声,不可逆的)量化过程。这与传统的方法相反,例如级联和反向级联,其中编码到约束系统中是可逆的。QCC能够校正的信道差错的可能数量在块长度$n$中是线性的,从而改进了现有技术已知方案可能的$O(\sqrt{n})$。对于一个给定的约束系统,QCC的性能取决于约束系统的一个新的基本参数-它的覆盖半径。受QCC的启发,我们研究了组合和概率两种约束条件下的覆盖半径。我们揭示了一个有趣的表征覆盖半径的约束系统遍历理论。我们使用这个等价的表征,以建立有效的可计算的覆盖半径上界。
英文摘要:
We introduce a novel framework for implementing error-correction in constrained systems. The main idea of our scheme, called Quantized-Constraint Concatenation (QCC), is to employ a process of embedding the codewords of an error-correcting code in a constrained system as a (noisy, irreversible) quantization process. This is in contrast to traditional methods, such as concatenation and reverse concatenation, where the encoding into the constrained system is reversible. The possible number of channel errors QCC is capable of correcting is linear in the block length $n$, improving upon the $O(\sqrt{n})$ possible with the state-of-the-art known schemes. For a given constrained system, the performance of QCC depends on a new fundamental parameter of the constrained system - its covering radius. Motivated by QCC, we study the covering radius of constrained systems in both combinatorial and probabilistic settings. We reveal an intriguing characterization of the covering radius of a constrained system using ergodic theory. We use this equivalent characterization in order to establish efficiently computable upper bounds on the covering radius.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。