hrvatski

Combinatorial designs over finite fields

Designs over finite fields represent a generalization of classical designs in terms of vector spaces, and were first introduced in the 1970's. Recently this topic attracts considerable attention. The recent application of these designs in error-correction in randomized network coding, made this topic more interesting than ever. Following the theory of classical designs, in this talk we generalize this concept. We present a few new theoretical results on this topic and we also present some variants of this concept with several concrete constructions.

designs over finite fields

nije evidentirano