A solution of an equivalence problem for semisimple cyclic codes
M.Muzychuk
TL;DR
This paper presents an efficient method to determine when two semisimple cyclic codes are equivalent, addressing a key problem in coding theory with potential applications in data transmission and error correction.
Contribution
The paper introduces a novel, efficient solution to the equivalence problem specifically for semisimple cyclic codes, improving upon existing methods.
Findings
The proposed method effectively distinguishes non-equivalent codes.
The solution reduces computational complexity compared to previous approaches.
It provides a practical tool for code classification and analysis.
Abstract
In this paper we propose an efficient solution of an equivalence problem for semisimple cyclic codes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · semigroups and automata theory · Quantum-Dot Cellular Automata