纠错码用于局部随机序列发生器

本文证明了好的线性分组码的编码器可作为好的线性局部随机序列发生器。此结论再一次揭示了纠错编码理论与现代密码学之间的有机联系。     

关于线性分组码的不可检错误概率

本文给出了检错好码的定义,证明了GF(2)上的(n,k)线性分组码为检错好码的充要条件是其对偶码也为检错好码。文中还得到了关于检错好码的一系列新的结果。对二元(n,k)线性分组码,我们给出了不可检错误概率新的下限。这些限只与n和k有关,而与码的重量结构无关。     

线性光耦SLC800在励磁系统测量单元中的应用

为了测量励磁系统测量单元中的励磁电流信号，文中给出了一种采用线性光耦SLC800组成的模拟信号隔离放大电路。实验结果表明：该线性光耦组成的模拟信号隔离放大电路具有隔离电压高、稳定性好、传输线性度好和温度特性好等特点，能够有效地解决模拟信号与系统的电气隔离问题。     

一种数字化混沌扩频序列发生器的设计

该文给出了一种基于FPGA芯片的数字化分段线性混沌映射系统的设计方法,该方法利用了m序列的扰动来克服有限精度下混沌序列的短周期行为;对用 VHDL实现的分段线性混沌序列发生器进行了门级仿真;将数字混沌序列的平衡性、相关性和线性复杂度等与实值混沌序列进行了比较,结论为:数字混沌序列的平衡性略比实值混沌序列差;自相关特性略好;N=63,255时,互相关特性略好,而N=31,127时互相关特性略差;二者的线性复杂度相当,为分段线性映射系统应用于扩频通信领域探索了一条途径。     

综论高效率宽频带线性功率放大器

多年来在无线电发送设备中的高频功率放大器要求输出功率大,效率高,频带宽,线性好。这些要求在技术上存在一些矛盾,如功率与效率之间的矛盾,带宽与线性之间的矛盾,功率、效率与线性之间的矛盾等等。要同时解决上述的矛盾,在技术上存在相当的困难。一     

一类线性移位寄存器的改造方法

线性移位寄存器由于能产生可控的随机性好的长周期序列,一直受到密码界的关注,但是,主要是对本原不可约多项式进行了深入的研究,对非本原不可约多项式的应用研究较少。这里给出了一种将联接多项式为非本原不可约的线性反馈移位寄存器改造成级数不变,线性递推关系相同,而从一个初始状态可获得分属不同圈的多个输出序列的线性时序电路的方法。     

基于对数比率放大电路的光功率测量

光功率测量是光纤通信系统最基本的测试参数之一。本文提出一种基于对数比率放大电路的光功率测量方法，相对于线性放大电路具有控制简单、动态范围大和线性度好的优点，是光缆在线监测的最佳选择。     

线性技术将主导下一代GSM，EDGE射频功放

GSM／EDGE手机射频部分功率放大器通常有两种实现方式，即极化方式与线性方式。前者将相位信号和幅值信号分开，分为两路在功放里合成，功放工作在饱和状态，效率比较高但线性度差；后者则是将二者在主芯片里组合，通过放大器进行放大，线性度好但效率较低。     

测量瓦级激光的光电型功率计的研制

文章介绍了由有色光学玻璃组成的窄带的测量3W以内激光的光电型功率计,具有杂光小、均匀性好、线性好、时间常数小等特点 。已研制了测量473nm、532nm、594nm、635nm、671nm、808nm、980nm、1064nm的光电型瓦级激光功率计。测试结果表明:线性比较好,均匀性误差在7‰以内,杂光小于1μW,重复性误差小于7‰,长期稳定性误差小于8‰。     

存储采样前馈序列的构造及性质

本文构造了一种新的前馈序列,称为存储采样前馈序列。我们证明了三个结论:存储采样前馈序列具有良好的0—1均衡性;存储采样前馈序列没有好的线性逼近;存储采样前馈序列有比较理想的线性复杂度。     

USING ERROR-CORRECTING ENCODERS TO DESIGN LOCAL-RANDOM SEQUENCE GENERATORS

This paper proved the statement that a good linear block encoder is in fact a good local-random sequence generator. Furthermore, this statement discovers the deep relationship between the error-correcting coding theory and the modern cryptography.     

系统卷积码盲识别

在未知情况下如何仅仅根据接收的数据识别出信道纠错码的参数,目前还是个很难解决的问题。文章根据线性分组码的性质提出了一种新型数据矩阵模型,用于对线性分组码进行盲识别,并将该方法推广应用到系统卷积码盲识别,取得了很好的效果。     

新的量子纠错码的构造

量子纠错码在量子通信和量子计算中起到非常关键的作用。文中首次利用三元图上的线性码来构造新的三元量子码,并给出了具体的量子纠错码的参数。     

On expander codes

Sipser and Spielman (see ibid., vol.42, p.1717-22, Nov. 1996) have introduced a constructive family of asymptotically good linear error-correcting codes-expander codes-together with a simple parallel algorithm that will always remove a constant fraction of errors. We introduce a variation on their decoding algorithm that, with no extra cost in complexity, provably corrects up to 12 times more errors     

满足k阶PC(l)的密码函数的新构造

该文基于线性分组码和双射函数,给出了满足七阶PC(l)的均衡相关免疫布尔函数新的构造方法。并据此进一步给出满足七阶PC(l)的(n,m,t)弹性函数的一般构造方法。此外,该文还揭示了这些函数的其它良好的密码学性质,如较高的非线性度、良好的代数次数、良好的构造计数等。     

一种四元厄米特LCD码与厄米特自正交码的构造方法

有限域上线性互补对偶（LCD）码具有良好的结构和性质,并在双用户加法器信道中得到了广泛的应用.自正交码是编码理论中一类重要的线性码,常被用于构造量子纠错码.本文根据有限域上线性码是厄米特LCD码或厄米特自正交码的判定条件,通过选取合适的定义集,构造出了四类四元厄米特LCD码和厄米特自正交码.同时,本文还研究了这四类线性码的厄米特对偶码,并得到了一些四元最优线性码.     

On the Performance of Short Forward Error-Correcting Codes

This letter investigates the performance of short forward error-correcting (FEC) codes. Reed-Solomon (RS) codes and concatenated zigzag codes are chosen as representatives of classical algebraic codes and modern simple iteratively decodable codes, respectively. Additionally, random binary linear codes are used as a baseline reference. Our main results (demonstrated by simulations and ensemble distance spectrum analysis) are as follows: 1) Short RS codes are as good as random binary linear codes; 2) Carefully designed short low-density parity-check (LDPC) codes are almost as good as random binary linear codes; 3) Low complexity belief propagation decoders incur considerable performance loss at short coding lengths. Thus, future work could focus on developing low-complexity (near) optimal decoders for RS codes and/or LDPC codes.     

Block-LDPC: a practical LDPC coding system design approach

This paper presents a joint low-density parity-check (LDPC) code-encoder-decoder design approach, called Block-LDPC, for practical LDPC coding system implementations. The key idea is to construct LDPC codes subject to certain hardware-oriented constraints that ensure the effective encoder and decoder hardware implementations. We develop a set of hardware-oriented constraints, subject to which a semi-random approach is used to construct Block-LDPC codes with good error-correcting performance. Correspondingly, we develop an efficient encoding strategy and a pipelined partially parallel Block-LDPC encoder architecture, and a partially parallel Block-LDPC decoder architecture. We present the estimation of Block-LDPC coding system implementation key metrics including the throughput and hardware complexity for both encoder and decoder. The good error-correcting performance of Block-LDPC codes has been demonstrated through computer simulations. With the effective encoder/decoder design and good error-correcting performance, Block-LDPC provides a promising vehicle for real-life LDPC coding system implementations.     

DC-free coset codes

A class of block coset codes with disparity and run-length constraints are studied. They are particularly well suited for high-speed optical fiber links and similar channels, where DC-free pulse formats, channel error control, and low-complexity encoder-decoder implementations are required. The codes are derived by partitioning linear block codes. The encoder and decoder structures are the same as those of linear block codes with only slight modifications. A special class of DC-free coset block codes are derived from BCH codes with specified bounds on minimum distance, disparity, and run length. The codes have low disparity levels (a small running digital sum) and good error-correcting capabilities     

Power Spectral Densities of Modulated Error-Correcting Coded Sequences

This paper finds an expression for the spectral density of an error-correcting coded digital sequence after modulation. This expression is valid for dependent source words and error-correcting linear block codes. Several examples are given of the ratio of the spectral density of the coded sequence to an uncoded sequence with identical source word rates for both independent and dependent source words.