Energy-harvesting sliding-window constrained block codes guarantee that within any prescribed window of $\ell $ consecutive bits the constrained sequence has at least $t$ , $t \geq 1$ , 1’s. Prior art code design methods build upon the finite-state machine description of the $(\ell,t)$ constraint, but as the number of states equals $\ell $ choose $t$ , a code design becomes prohibitively complex for mounting $\ell $ and $t$ . We present a new block code construction that circumvents the enumeration of codewords using a finite-state description of the $(\ell,t)$ -constraint. The codewords of the block code are encoded and decoded using a single look-up table. For $(\ell =4,t=2)$ , the new block codes are maximal, that is, they have the largest possible number of codewords for its parameters.

中文翻译：

---

能量收集滑动窗口约束通道的块代码

能量收集滑动窗口约束块码保证在 $\ell $ 连续位的任何规定窗口内，约束序列至少有 $t$ , $t \geq 1$ , 1。现有技术的代码设计方法建立在 $(\ell,t)$ 约束的有限状态机描述上，但是当状态数等于 $\ell $ select $t$ 时，代码设计变得非常复杂，无法安装 $ \ell $ 和 $t$ 。我们提出了一种新的块代码构造，它使用 $(\ell,t)$ 约束的有限状态描述来规避码字的枚举。块代码的码字使用单个查找表进行编码和解码。对于 $(\ell =4,t=2)$ ，新的块码是最大的，也就是说，它们的参数的码字数可能最大。