X 代码是 -6 编码能够容忍的独立磁盘(袭击) 的最重要的冗余的数组之一两倍磁盘失败。然而, X 代码的代码长度被限制是一个素数,和 X 代码限制的如此的代码长度限制它在真实存储系统的用法。而且作为垂直 RAID-6 代码, X 代码不能容易被扩大到象水平 RAID-6 代码一样的任意的代码长度。在这份报纸,为 X 代码的一篇小说和有效代码弄短算法被建议扩大 X 代码到任意的长度。这能进一步被证明弄短的代码算法维持 X 代码的 maximum-distance-separable (MDS ) 性质,并且也就是,弄短的 X 代码仍然是有最佳的空间效率的 MDS 代码。在为 X 代码的弄短的算法的上下文,在连续代码长度的 X 代码上的深入的性能分析被进行,并且弄短的代码的影响在各种各样的性能度量标准的 X 代码的性能上的算法被揭示。
X-Code is one of the most important redundant array of independent disk (RAID)-6 codes which are capable of tolerating double disk failures. However, the code length of X-Code is restricted to be a prime number, and such code length restriction of X-Code limits its usage in the real storage systems. Moreover, as a vertical RAID-6 code, X-Code can not be extended easily to an arbitrary code length like horizontal RAID-6 codes. In this paper, a novel and efficient code shortening algorithm for X-Code is proposed to extend X-Code to an arbitrary length. It can be further proved that the code shortening algorithm maintains the maximum-distance-separable (MDS) property of X-Code, and namely, the shortened X-Code is still MDS code with the optimal space efficiency. In the context of the shortening algorithm for X-Code, an in-depth performance analysis on X-Code at consecutive code lengths is conducted, and the impacts of the code shortening algorithm on the performance of X-Code in various performance metrics are revealed.