Algorithm 1 Algorithm to compute A for fractional repetition coding.

Input:B = Bfrac;

f ← binom(n,s)  A ← zeros(f,n)  for I ⊆ [n], s.t.∣I∣ = (n − s) do

⌊ a = zeros(1,k)  x = ones(1,k)/B(I,:)  a(I) = x  A = [A;a]

output:A s.t. AB = 1f×k;