Selective encryption of Huffman compressed text

Miodrag Živković

Displaying similar documents to “Selective encryption of Huffman compressed text”

An interesting new Mahonian permutation statistic.

Wilson, Mark C. (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times.

Allahverdi, Ali, Aldowaisan, Tariq, Sotskov, Yuri N. (2003)

International Journal of Mathematics and Mathematical Sciences

Similarity:

A card shuffling analysis of deformations of the Plancherel measure of the symmetric group.

Fulman, Jason (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Ascents of size less than d in compositions

Maisoon Falah, Toufik Mansour (2011)

Open Mathematics

Similarity:

A composition of a positive integer n is a finite sequence π1π2...πm of positive integers such that π1+...+πm = n. Let d be a fixed number. We say that we have an ascent of size d or more (respectively, less than d) if πi+1 ≥ πi+d (respectively, πi < πi+1 < πi + d). Recently, Brennan and Knopfmacher determined the mean, variance and limiting distribution of the number of ascents of size d or more in the set of compositions of n. In this paper, we find an explicit formula for the...