New Construction for Binary Sequences of Period with Optimal Autocorrelation Using
New Construction for Binary Sequences of Period with Optimal Autocorrelation Using
复制标题
DOI：
--
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
Jong-Seon No;Habong Chung;Hong‐Yeop Song;Kyeongcheol Yang;Jung-Do Lee;T. Helleseth
中科院分区：
文献类型：
--
作者：
Jong-Seon No;Habong Chung;Hong‐Yeop Song;Kyeongcheol Yang;Jung-Do Lee;T. Helleseth
．然而，另一方面，我们要求相同输入标签的两个候选码字具有不同的奇偶校验，标签边缘终止于相同的状态，并且位于地址256处。由于这些条件，与Section III-B中的64个条目相比，只有53个条目可被访问。的块解码器是通过删除包含码字的条目的10位地址的两个最高位来获得的。当限制到域时，这也是一个块解码器，其范围由具有最低有效位的字节组成。编码器是弱可见的。如果我们不排除28位模式，则可以获得嵌套和完全可观察性
.Yet, on the other hand, we require that two codeword candidates for the same input tag have different parity, label edges that terminate in the same state, and be located in at addresses 256 apart. Due to those conditions, only 53 entries in are accessible by , compared to 64 entries in Section III-B. A block decoder of is obtained by deleting the two most significant bits of the 10-bit address of the entry in that contains the codeword . When restricted to the domain , this is also a block decoder of , with the range consisting of bytes having least significant bits “ .” The encoder is weakly observable from . Nesting and full observability can be attained if we do not exclude the 28-bit pattern