Sign in

Optimal Busy-Node Repair of (k+4,k,4) MDS Codes With Small Sub-Packetization Level.

Jiayi RuiQin HuangYunghsiang S. HanTing-Yi Wu
Published in: IEEE Commun. Lett. (2023)
Keyphrases
  • application level
  • dynamic programming
  • worst case
  • optimal path
  • small number
  • bitstream
  • graph structure
  • ip networks