this MR adds examples/inbreeding.rs which allows to do two things
naive recoding: in order to generate a new random shard, we first k-decode the whole data and then 1-encode a single shard
true recoding: to achieve the same goal, we directly k-recode shards into a new one
the scenario
regardless of the recoding strategy, the scenario is the same
data is split into k shards and n original shards are generated
for a given number of steps s, k shards are drawn randomly with replacement and we count the number of successful decoding, given a measure of the diversity, \delta = \frac{\#success}{\#attempts}
create a new recoded shard and add it to the n previous ones, i.e. n increases by one
