Gordon Simons

Learn More
We consider a binary symmetric channel where the input, modeled as an innnite sequence of bits, is distorted by a Bernoulli noise. In 8], a consistent estimator of the distortion, i.e., of the probability that a single bit is changed, is described under the basic assumption that the complexity of the input is nite. Here, we deal with two shortcomings: 1.(More)
In the last century, Desire Andre obtained many remarkable properties of the numbers of alternating permutations, linking them to trigonometric functions among other things. By considering the probability that a random permutation is alternating and that a random sequence (from a uniform distribution) is alternating, and by conditioning on the first element(More)
  • 1