scientific article; zbMATH DE number 1284424

From MaRDI portal
Publication:4242018





[For the entire collection see Zbl 0907.94001.] The paper describes and surveys many old open problems on cyclic codes. Several famous and important open problems about the minimum distance and weight distribution of cyclic codes are studied. Two problems that are discussed in detail are the minimum distance of binary narrow-sense primitive BCH codes and the weight distribution of binary Reed-Muller (RM) codes. Other problems studied include the weight enumerator of cyclic codes with two zeros and the automorphism group of cyclic codes. Connections between cyclic codes and related problems are presented. These connections include relations between cyclic codes and almost perfect nonlinear functions and almost bent functions. Connections between cyclic codes and Goppa codes are considered. Also a new original proof of the formal duality of Preparata and Kerdock codes is given based on cyclic codes and their cosets. This well written chapter contains many interesting results on cyclic codes.




Cited in
(66)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242018)