| 1. | Research of almost perfect punctured binary sequence pairs
几乎最佳屏蔽二进序列偶的研究 |
| 2. | Prbs pseudo - random binary sequence
伪随机二进制序列 |
| 3. | Pseudo random binary sequence
伪随机二元序列 |
| 4. | Many researches have been done to create pseudo - random binary sequence which can be a substitute of conventional sequence
但传统序列存在数量少,周期短等缺点,使通信系统性能不尽如人意。 |
| 5. | The method encrypts the copyright information into binary sequence for repeated embedding and the intensity of watermarking can be set by the user
即将版权信息加密成二进制序列,重复嵌入文本中,水印嵌入的强度由用户决定。 |
| 6. | The function of the assembler is to change assembly language to binary sequence , which makes it easier for the user to program with the chip
汇编器将芯片的汇编语言转换为芯片可以执行的二进制代码，使芯片的应用者不必使用二进制代码进行开发。 |
| 7. | From the point of view of a computer scientist , all software consists of a sequence of 1 s and 0 s , and , therefore , all text and text fragments consist of binary sequences
从计算机科学家的角度看，所有软件都是由1和0组成的，因此所有文字和文字段落都是由二进制序列组成的。 |
| 8. | 3 . a fast algorithm is proposed for computing the linear complexity of a binary sequence with period p ? and generalized one for determining the linear complexity of a sequence with period pfl over gf ( q )
提出了一个计算周期为p ~ n的二元序列的线性复杂度的快速算法，并推广为确定gf （ q ）上周期为p ~ n的序列线性复杂度的快速算法。 |
| 9. | 4 . a fast algorithm for computing the linear complexity and the minimal polynomial of a binary sequence with period t ? m is proposed , and generalized one for determining the linear complexity of a sequence with period pmqfl over gf ( q )
提出确定周期为2 ~ np ~ m的二元序列的线性复杂度和极小多项式的一个快速算法，并推广为计算gf （ q ）上周期为p ~ mq ~ n序列的线性复杂度和极小多项式的快速算法。 |
| 10. | Chebyshev map is a one ? imension chaotic map which has simple iteration equation easy to be realized , and extremely sensitive on initial conditions , in this thesis we use various quantization functions to generate binary sequences for ds ? s and multilevel sequences for fh ? s
Chebyshev混沌映射是一种一维混沌映射，其迭代方程简单，易于实现，且对初始值极其敏感。本文通过不同的量化函数得到直扩序列和跳频序列。 |
