SOME PROBABILITY PROBLEMS CONCERNING THE MARKING OF CODES INTO THE SUPERIMPOSITION FIELD

Abstract

We deal here with some problems of superimposed random coding that arise when marking codes into the codefield. Our investigations are concerned with a general model. Systems used in practice are special cases of this, and may be deduced from it by making appropriate simplifying assumptions. We give exact formulas for the distribution of the marked sites in a codefield and for the distribution of multiple marking of a site. These results are obtained by applying a general theorem in probability due to K. Jordan. Some acquaintance with superimposed random coding and knowledge of basic combinatorial and probability theory are assumed.