桂林电子科技大学学报2026，Vol.46Issue(4)：403-411,9.DOI:10.16725/j.1673-808X.202361
基于生成矩阵变换与遗传算法的RS柯西码编码优化
Optimization of RS Cauchy code based on generator matrix transformation and genetic algorithm
摘要
Abstract
To solve the problem that the encoding process of erasure codes in a distributed storage system incurs high computational complexity,leading to low data write rates,a matrix generation optimization and coding scheduling scheme specifically for Reed-Solomon(RS)Cauchy codes is proposed.First,the selection of the generator matrix is optimized by proposing a greedy low-density scheme.By analyzing the sparsity of the exclusive-or(XOR)operation matrix corresponding to the elements in the Galois Field,an initial row solution is established greedily,and subsequently,the optimized sparse Cauchy matrix is derived through traversal,there-by reducing the computational overhead of the encoding process.Secondly,the GA-CSHR algorithm is proposed to optimize the en-coding process of the binary matrix following Cauchy matrix transformation,which uses a genetic algorithm to address the limita-tions of CSHR and Uber-CSHR algorithms,by caching the intermediate value of the computation process and Heuristically select-ing the target block,the number of XOR calculations in the encoding process is reduced.The experimental results show that,com-pared to the original RS-Cauchy code,the computational complexity of the encoding process is significantly reduced by the pro-posed scheme based on greedy algorithms and the genetic algorithm.关键词
纠删码/分布式存储/柯西矩阵/遗传算法/编码加速Key words
erasure codes/distributed storage/Cauchy matrix/genetic algorithm/coding acceleration分类
信息技术与安全科学引用本文复制引用
李树林,陈俊奇,王勇,杨思捷..基于生成矩阵变换与遗传算法的RS柯西码编码优化[J].桂林电子科技大学学报,2026,46(4):403-411,9.基金项目
国家自然科学基金(61831013) （61831013）
广西创新驱动重大专项(桂科AA18118031) （桂科AA18118031）
广西研究生教育创新计划(2023YCXB06) （2023YCXB06）
广西研究生教育创新计划(YCSW2021179) （YCSW2021179）
