  We present a hashing protocol for distilling multipartite CSS states by means
of local Clifford operations, Pauli measurements and classical communication.
It is shown that this hashing protocol outperforms previous versions by
exploiting information theory to a full extent an not only applying CNOTs as
local Clifford operations. Using the information-theoretical notion of a
strongly typical set, we calculate the asymptotic yield of the protocol as the
solution of a linear programming problem.
