A 3-cluster error-correcting code is obtained by constructing a three-dimensional parity-check matrix, which not only can correct a single 3-cluster error but also turns out to be nearly opti-mal by the sphere-packing bound.%对于发生在二维平面上的十字型突发性错误,通过了构造三维的校验矩阵,得到了可纠正3个突发性错误的纠错码,并由sphere-packing界证明它是次最优的.
展开▼