On Codes from Split Metacyclic Groups
By: Kirill Vedenev
Potential Business Impact:
Finds new ways to break secret codes.
The paper presents a comprehensive study of group codes from non-abelian split metacyclic group algebras. We derive an explicit Wedderburn-like decomposition of finite split metacyclic group algebras over fields with characteristic coprime to the group order. Utilizing this decomposition, we develop a systematic theory of metacyclic codes, providing their algebraic description and proving that they can be viewed as generalized concatenated codes with cyclic inner codes and skew quasi-cyclic outer codes. We establish bounds on the minimum distance of metacyclic codes and investigate the class of induced codes. Furthermore, we show the feasibility of constructing a partial key-recovery attack against certain McEliece-type cryptosystems based on metacyclic codes by exploiting their generalized concatenated structure.
Similar Papers
A Group Theoretic Construction of Batch Codes
Information Theory
Makes computer storage faster and more reliable.
Quasi-cyclic codes of index 2
Information Theory
Makes computer codes more efficient for sending information.
On alternating-conjugate splitting methods
Numerical Analysis
Makes computer math problems solve better over time.