THE APPLICATION OF LINEAR COMPLEXITY OF SEQUENCES TO LOWER BOUNDS ON THE MINIMUM DISTANCE OF CYCLIC CODES  

作　　者：李元兴 粱传甲 

机构地区：[1]Xidian University,Xi'an

出　　处：《Journal of Electronics(China)》1990年第4期312-316,共5页电子科学学刊（英文版）

摘　　要：Firstly,the Fourier transforms in finite fields and the concept of linear complexityof sequences are described.Then several known lower bounds on the minimum distance of cycliccodes are outlined.Finally,the minimum distance of cyclic codes is analyzed via linear complexityof sequences,and new theorems about the lower bounds are obtained.Firstly,the Fourier transforms in finite fields and the concept of linear complexity of sequences are described.Then several known lower bounds on the minimum distance of cyclic codes are outlined.Finally,the minimum distance of cyclic codes is analyzed via linear complexity of sequences,and new theorems about the lower bounds are obtained.

关 键 词：CYCLIC CODES Linear COMPLEXITY FOURIER transforms 

分 类 号：TN01[电子电信—物理电子学]