On equivalency of zero-divisor codes via classifying their idempotent generator
From MaRDI portal
Publication:2004965
DOI10.1007/s10623-020-00762-7zbMath1465.94143OpenAlexW3034089015MaRDI QIDQ2004965
Publication date: 7 October 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-020-00762-7
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Group rings of finite groups and their modules (group-theoretic aspects) (20C05) Other types of codes (94B60) Subnormal subgroups of abstract finite groups (20D35)
Related Items (2)
On equivalence of cyclic and dihedral zero-divisor codes having nilpotents of nilpotency degree two as generators ⋮ Burst error-correcting quantum stabilizer codes designed from idempotents
Cites Work
- Unnamed Item
- Codes from zero-divisors and units in group rings
- Minimal cyclic codes of length \(p^nq\)
- Idempotents in group algebras and minimal abelian codes
- An introduction to group rings
- Convolutional codes from units in matrix and group rings
- An elementary proof of the MacWilliams theorem on equivalence of codes
- Study of idempotents in cyclic group rings over F2
- Binary Codes Which Are Ideals in the Group Algebra of an Abelian Group
- On the theory of group codes
This page was built for publication: On equivalency of zero-divisor codes via classifying their idempotent generator