One of the most remarkable and beautiful theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes and their connections with invariant theory, which has inspired hundreds of papers about generalizations and applications of this theorem to different types of codes. This self-contained book develops a new theory which is powerful enough to include all the earlier generalizations.
The study of finite rational matrix groups reduces to the investigation of the maximal finite irreducible matrix groups and their natural lattices, which often turn out to have rather beautiful geometric and arithmetic properties. This book presents a full classification in dimensions up to 23 and with restrictions in dimensions and p +1 and p-1 for all prime numbers p. Nonmaximal finite groups might act on several types of lattices and therefore embed into more than one maximal finite group. This gives rise to a simplicial complex interrelating the maximal finite groups and measuring the complexity of the dimension. Group theory, integral representation theory, arithmetic theory of quadratic forms and algorithmic methods are used.
One of the most remarkable and beautiful theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes and their connections with invariant theory, which has inspired hundreds of papers about generalizations and applications of this theorem to different types of codes. This self-contained book develops a new theory which is powerful enough to include all the earlier generalizations.
The study of finite rational matrix groups reduces to the investigation of the maximal finite irreducible matrix groups and their natural lattices, which often turn out to have rather beautiful geometric and arithmetic properties. This book presents a full classification in dimensions up to 23 and with restrictions in dimensions and p +1 and p-1 for all prime numbers p. Nonmaximal finite groups might act on several types of lattices and therefore embed into more than one maximal finite group. This gives rise to a simplicial complex interrelating the maximal finite groups and measuring the complexity of the dimension. Group theory, integral representation theory, arithmetic theory of quadratic forms and algorithmic methods are used.
This will help us customize your experience to showcase the most relevant content to your age group
Please select from below
Login
Not registered?
Sign up
Already registered?
Success – Your message will goes here
We'd love to hear from you!
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.