On the Error-Correcting Performance of some Binary and Ternary Linear Codes

In this work, we determine the coset weight spectra of all binary cyclic codes of lengths up to 33, ternary cyclic and negacyclic codes of lengths up to 20 and of some binary linear codes of lengths up to 33 which are distance-optimal, by using some of the algebraic properties of the codes and a computer assisted search. Having these weight spectra the monotony of the function of the undetected error probability after t-error correction P(t)ue (C,p) could be checked with any precision for a linear time. We have used a programm written in Maple to check the monotony of P(t)ue (C,p) for the investigated codes for a finite set of points of p € [0, p/(q-1)] and in this way to determine which of them are not proper.

Some Theoretical Results on the Progeny of a Bisexual Galton-Watson Branching Process

A Superadditive Bisexual Galton-Watson Branching Process is considered and the total number of mating units, females and males, until the n-th generation, are studied. In particular some results about the stochastic monotony, probability generating functions and moments are obtained. Finally, the limit behaviour of those variables suitably normed is investigated.

Some Probabilistic Results in a Bisexual Branching Process with Immigration

2000 Mathematics Subject Classification: 60J80.