Focus on: Channel Coding and Information Theory

1993 ◽  
Vol 4 (2) ◽  
pp. 123-124
2010 ◽  
Vol Vol. 12 no. 1 (Combinatorics) ◽  
Author(s):  
Michael Huber

Combinatorics International audience Block-transitive Steiner t-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory, and cryptography. The main result of the paper settles an important open question: There exist no non-trivial examples with t = 7 (or larger). The proof is based on the classification of the finite 3-homogeneous permutation groups, itself relying on the finite simple group classification.


Sign in / Sign up

Export Citation Format

Share Document