Binary Cyclic Codes and Minimal Codewords  

作　　者：Selda Calkavur 

机构地区：[1]Department of Computer Programming, Koeaeli University, Kocael 41135, Turkey

出　　处：《Computer Technology and Application》2013年第9期486-489,共4页计算机技术与应用（英文版）

摘　　要：Cyclic codes form an important class of codes. They have very interesting algebraic structure. Furthermore, they are equivalent to many important codes, such as binary Hamming codes, Golay codes and BCH codes. Minimal codewords in linear codes are widely used in constructing decoding algorithms and studying linear secret sharing scheme. In this paper, we show that in the binary cyclic code all of the codewords are minimal, except 0 and 1. Then, we obtain a result about the number of minimal codewords in the binary cyclic codes.

关 键 词：Linear code cyclic code binary cyclic code generator polynomial minimal codeword secret sharing. 

分 类 号：TN911.22[电子电信—通信与信息系统] TP301.6[电子电信—信息与通信工程]