Code automorphism group algorithms and applications

  • Cho, Han-Hyuk (Department of Mathematics Education, Seoul National University) ;
  • Shin, Hye-Sun (Department of Mathematics Education, Seoul National University) ;
  • Yeo, Tae-Kyung (Department of Mathematics Education, Seoul National University)
  • Published : 1996.07.01

Abstract

We investigate how the code automorphism groups can be used to study such combinatorial objects as codes, finite projective planes and Hadamard matrices. For this purpose, we write down a computer program for computing code automorphisms in PASCAL language. Then we study the combinatorial properties using those code automorphism group algorithms and the relationship between combinatorial objects and codes.

Keywords