The minimum distance of the [38, 19] ternary extended QR-code is 11
暂无分享,去创建一个
The method of Mykkeltveit, Lam, and McEliece for finding weight enumerators of binary QR-codes is used to prove that the minimum distance of the [38,19] ternary extended QR-code is 11 .
[1] N. Sloane. Error-Correcting Codes and Invariant Theory: New Applications of a Nineteenth-Century Technique , 1977 .
[2] Kees Roos,et al. A new lower bound for the minimum distance of a cyclic code , 1983, IEEE Trans. Inf. Theory.