No label defined (Q4242018)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1284424
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1284424

      Statements

      0 references
      17 December 1999
      0 references
      cyclic codes
      0 references
      open problems
      0 references
      minimum distance
      0 references
      weight distribution
      0 references
      primitive BCH codes
      0 references
      binary Reed-Muller codes
      0 references
      weight enumerator
      0 references
      automorphism group
      0 references
      almost perfect nonlinear functions
      0 references
      almost bent functions
      0 references
      Goppa codes
      0 references
      duality of Preparata codes and Kerdock codes
      0 references
      [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.
      0 references

      Identifiers