-
The minimum distance decoding of linear codes is NP-hard, but some solvable cases exist.
线性分组码的最小距离译码是NP -难问题,但有些情况可解。
youdao
-
The minimum distance decoding of linear codes is NP-hard, but some solvable cases exist.
线性分组码的最小距离译码是NP -难问题,但有些情况可解。
youdao