What people are saying - Write a review
We haven't found any reviews in the usual places.
T Beth Some Aspects of Coding Theory between Probability
A Beutelspacher Generalized Schur Numbers
H Brehm Description of Spherically Invariant Random Processes
16 other sections not shown
Other editions - View all
Combinatorial Theory: Proceedings of a Conference Held at Schloss ...
D. Jungnickel,K. Vedder
Limited preview - 2006
affine algorithm assume asymptotic 0-1 laws automorphism group basic bialgebra bijection binary block graph bound coloring combinatorial components compute condition consider construction contains Corollary corresponding counteroval cyclic define denote diagram disjoint edges elements enumeration epimorphisms equivalence relation eveAy example exiiti exponential finite sets first-order PDF formula function G-functions geometry GF(q given Goppa-codes group G Hence hyperoval implies incidence algebras incidence matrix indecomposable integer irreducible polynomials isomorphism ISuc(S Lemma linear linear codes m-sum free Math matrix monoid monomial monomorphisms morphism multiplication multiset nk(G notation obtain orbits oval parameters partitions permutation permutation group plane points polynomial problem Proof properties Proposition PSDS quasi-symmetric 2-design random regular set resp satisfies sequence SIRP Steiner system Steiner Triple Systems strongly regular graph structure STS(v subgroups subsets symmetric Theorem theory topological tree unipotent groups unique Vasil'ev codes vector vertex vertices wordchain yields