Extending Reed-Solomon codes to modules
暂无分享,去创建一个
Desmedt-Frankel (June 1991) presented an erasure code in which the entries of the codewords belong to any abelian group. We extend this work to error-correction.
[1] Yvo Desmedt,et al. Perfect Zero-Knowledge Sharing Schemes over any Finite Abelian Group , 1993 .
[2] Mario Blaum,et al. New array codes for multiple phased burst correction , 1993, IEEE Trans. Inf. Theory.
[3] N. J. A. Sloane,et al. Shift-Register Synthesis (Modula m) , 1985, CRYPTO.
[4] Yvo Desmedt,et al. Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group , 1994, SIAM J. Discret. Math..