What people are saying - Write a review
We haven't found any reviews in the usual places.
J Abrham Critical Perfect Systems of Difference Sets with
T Beth Some Aspects of Coding Theory between Probability
A Beutelspacher Generalized Schur Numbers
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 bound codewords combinatorial components compute condition consider construction contains Corollary corresponding counteroval cyclic define denote disjoint edges elements enumeration epimorphisms equation equivalence relation example exists a T-subtree exponential finite sets first-order PDF formula function G-functions geometry GF(q given Goppa-codes group G Hamming code Hence hyperoval implies incidence algebras incidence matrix indecomposable integer isomorphism Lemma linear codes m-sum free Math matrix monoid monomial monomorphisms morphism multiplication nk(G notation obtain orbits oval parameters partitions permutation permutation group plane points polynomial problem Proof properties Proposition PSDS PSTS quasi-symmetric 2-design random regular set resp satisfies sequence SIRP Steiner systems Steiner Triple Systems strongly regular graph structure subgroup subsets symmetric Theorem theory topological tree unipotent groups unique Vasil'ev codes vector vertex vertices wordchain yields