We show that for every length of form $4^k-1$, there exists a binary $1$-perfect code that does not include any Preparata-like code.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。