Institut de Mathématiques de Luminy

Abstract 2002-04

Vladimir Blinovsky.
Some combinatorial problems in coding and information theory

We consider several solved and unsolved problems from the combinatorial coding and information theory such as multiple packing of discrete spaces, bounds for the probability of error in discrete channels. We expose recent progress in solving these problems for large sizes of alphabets. Also we introduce some new in coding and information theory problems which allow us to obtain final (in some sense) results in this area.


Last update : february 15, 2002, EL.