Keyun Cheng

Reading Notes: ISIT’18 Scaling via Network Coding

Title: Generalized Optimal Storage Scaling via Network Coding

Conference (ISIT’18): Link

Journal (): Link

Summary

This paper proves the minimum scaling (up) bandwidth for general (n, k). It also provides a theoretically possible construction (by proving the existence) of MDS random linear codes that achieves the optimal scaling bandwidth.

Main Contributions

• The extended information flow graph from NCScale for a general (n, k) to (n’, k’)

• Proving the existance of random linear code with the optimal scaling bandwidth

Details

• This paper extends NCScale with a more general (n, k), previously k = k’; now they can be different.
  • Discussion on the k and k’
• The context is based on scale up.

Strength

Weakness

• Currently, no explicit constructions of the random linear code is provided or discussed in the paper.

• The exact lower bound of field size is not discussed.