论文信息 - Designing codes for storage allocation

Designing codes for storage allocation

Service rates for storage allocation were considered in [11]. In this notes we consider the design of good or optimal codes with respect to this metric. The cases of two files is completely and the case of three files is partially resolved, see also [8] where a subset of these results are presented in a more compact way.

Sascha Kurz | Sascha Kurz

[1] Michael Joswig,et al. Algorithms for highly symmetric linear and integer programs , 2010, Mathematical Programming.

[2] Alexander Schrijver,et al. Invariant Semidefinite Programs , 2010, 1007.2905.

[3] David Gale,et al. Neighborly and cyclic polytopes , 1963 .

[4] Fatemeh Kazemi,et al. Efficient Storage Schemes for Desired Service Rate Regions , 2020, ArXiv.

[5] Fatemeh Kazemi,et al. A Geometric View of the Service Rates of Codes Problem and its Application to the Service Rate of the First Order Reed-Muller Codes , 2020, 2020 IEEE International Symposium on Information Theory (ISIT).

[6] Moslem Noori,et al. On storage allocation for maximum service rate in distributed storage systems , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[7] Sascha Kurz,et al. Minimal Proper Non-IRUP Instances of the One-Dimensional Cutting Stock Problem , 2014, Discret. Appl. Math..

[8] Eitan Yaakobi,et al. PIR Codes with Short Block Length , 2020, ArXiv.

[9] P. McMullen. The maximum numbers of faces of a convex polytope , 1970 .

[10] Jeroen Kuipers,et al. On the Number of Extreme Points of the Core of a Transferable Utility Game , 2002 .

[11] P. Parrilo,et al. Symmetry groups, semidefinite programs, and sums of squares , 2002, math/0211450.