国产欧美精品一区二区,中文字幕专区在线亚洲,国产精品美女网站在线观看,艾秋果冻传媒2021精品,在线免费一区二区,久久久久久青草大香综合精品,日韩美aaa特级毛片,欧美成人精品午夜免费影视

Locally Repairable Codes (Locally Repairable Codes, LRCs), as one of the erasure codes, are widely used in distributed storage systems. Aiming at the problem that the current locally repairable code has low code rate and large locality parameter restriction when meeting the minimum distance optimal bound, this paper proposes a construction method of optimal locally repairable code based on the square network. It uses the square network to construct the check matrix of the locally repairable codes, and starts from the check matrix to construct the locally repairable codes, which achieves the optimal rate bound, but its locality is not high. By further extending the incidence matrix in horizontal and vertical directions of the square network, the performance of the locally repairable codes constructed are improved in locality. And compared with the existing locally repairable codes, the locally repairable codes constructed not only meet the minimum distance optimal bound, but also reach the rate optimal bound of the locally repairable codes, which can be applied to any locality. The construction has reference significance for the construction of bivariate optimal locally repairable codes.