Minimum distance and idempotent generators of minimal cyclic codes of length ${p_1}^{\alpha_1}{p_2}^{\alpha_2}{p_3}^{\alpha_3}$
From MaRDI portal
Publication:3390314
DOI10.13069/jacodesmath.1000837zbMath1487.94169OpenAlexW3203067085MaRDI QIDQ3390314
Publication date: 24 March 2022
Published in: Journal of Algebra Combinatorics Discrete Structures and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.13069/jacodesmath.1000837
Cites Work
- Unnamed Item
- Some cyclic codes of length \(2p^n\)
- Minimal cyclic codes of length \(p^nq\)
- Wedderburn decomposition of finite group algebras.
- Primitive idempotents and generator polynomials of some minimal cyclic codes of length \({p^n}{q^m}\)
- Idempotents in group algebras and minimal abelian codes
- Minimal codes of prime-power length.
- Minimal cyclic codes of length \(2p^n\)
- Minimal cyclic codes of length \(p^{n} q\).
- Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x/(x^{p^n} - 1)\)]
- λ-Mapping and Primitive Idempotents in Semisimple Ring ℜm
- The Algebraic Structure of Finite Metabelian Group Algebras
- A class of minimal cyclic codes over finite fields
This page was built for publication: Minimum distance and idempotent generators of minimal cyclic codes of length ${p_1}^{\alpha_1}{p_2}^{\alpha_2}{p_3}^{\alpha_3}$
