%I #24 Oct 29 2018 13:04:07
%S 1,3,4,10,8,16,19,28,17,50,23,48,59,68,34,96,40,115,101,96,52,181,98,
%T 120,134,191,73,268,81,209,190,173,214,361,104,201,234,390,118,428,
%U 126,350,411,261,140,560,247,425,337,439,165,566,397,615,391,350,189,920
%N Number of Fractional Repetition codes for n nodes.
%C Table II of Anil. In a distributed storage systems (DSS), regenerating codes are used to optimize bandwidth in the repair process of a failed node. To optimize other DSS parameters such as computation and disk I/O, Distributed Replication-based Simple Storage (Dress) Codes consisting of an inner Fractional Repetition (FR) code and an outer MDS code are commonly used.
%H Michel Marcus, <a href="/A222136/b222136.txt">Table of n, a(n) for n = 3..180</a>
%H Srijan Anil, Manish K. Gupta, T. Aaron Gulliver, <a href="http://arxiv.org/abs/1303.6801">Enumerating Some Fractional Repetition Codes</a>, arXiv:1303.6801v1 [cs.IT], Mar 27, 2013.
%H T. Aaron Gulliver, <a href="http://www.ece.uvic.ca/~agullive/manish/List.html">No. of nodes n/No. of FR codes possible</a> (gives more data for b-file).
%H T. Aaron Gulliver, <a href="/A222136/a222136.pdf">No. of nodes n/No. of FR codes possible</a> (gives more data for b-file). [Cached copy, with permission; pdf format only]
%K nonn
%O 3,2
%A _Jonathan Vos Post_, Mar 27 2013
%E Terms a(11) and beyond from b-file by _Andrew Howroyd_, Feb 05 2018
|