One Pair to Rule Them All: Towards an Optimal Algorithm for Solving Code Equivalence via Codeword Search
Alessandro B
·
2026-02-16
·
via Cryptology ePrint Archive
Two linear codes $\mathcal{C},\mathcal{C}’$ over $\mathbb{F}_q$ are linearly equivalent if one can be mapped…
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。