On equivalency of zero-divisor codes via classifying their idempotent generator (Q2004965)

From MaRDI portal
Revision as of 17:59, 23 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On equivalency of zero-divisor codes via classifying their idempotent generator
scientific article

    Statements

    On equivalency of zero-divisor codes via classifying their idempotent generator (English)
    0 references
    0 references
    0 references
    7 October 2020
    0 references
    \textit{P. Hurley} and \textit{T. Hurley} [Int. J. Inf. Coding Theory 1, No. 1, 57--87 (2009; Zbl 1213.94194)] presented a new construction method for codes using encodings from group rings. Their method is applicable for several group rings \(RG\) for a ring \(R\) and a group \(G\). In particular, for \(R\)-submodules of \(RG\) generated by zero-divisors are constructed. Such codes are called \textit{zero-divisor codes}. In this paper, the authors study the equivalency of zero-divisor codes in the group ring \({\mathbf F}_2 G.\) Denote by \(I(G)\) the set of all idempotent elements in \({\mathbf F}_2G.\) Let \(G\) be a finite abelian group and let \(e\in I(G)\) with \(|\mbox{supp}(e)|=k.\) If \(e =\sum\limits_{i=0}^{k-1}g^{2^i},\) for \(g\in \mbox{supp} (e)\) then \(e\) is called \textit{generated idempotent} in \(I(G)\) with generator \(g\) and is denoted by \(\langle g\rangle_{I_d}.\) The set of all generated idempotents in \({\mathbf F}_2 G\) is denoted by \(I_{I_d}. \) The authors [J. Indones. Math. Soc. 23, 67--75 (2017; Zbl 1471.94036)] proved that for abelian \(G\) the generated idempotents completely classify \(I(G)\) by serving as its basis. For non-abelian \(G\) to study the equivalency of zero-divisor codes in \({\mathbf F}_2 (G)\), one has to generalize the notion of generated idempotents. The authors do this by studying the properties of the set \[ J( G) =\{ \langle g\rangle_{I_d}\in I_{I_d}(G)\; | \;\langle g\rangle_{I_d}+ \langle h \rangle_{I_d}\}\in I(G) \mbox{ for every }\langle h \rangle_{I_d}\in I_{I_d}(G) \] called the set of \textit{joint idempotents}. A complete classification of \(J(G)\) is given for several families (e.g. if \(G\) is of order \(pq\), or order of \(2^kp\) with odd prime numbers \(p,q\), and a dihedral group) of \({\mathbf F}_2 (G),\) where \(G\) is non-abelian. The authors prove that every group ring code in \({\mathbf F}_2D_{2^n}\) is equivalent to some code in \({\mathbf F}_2C_{2n}\) in the cases where the generators are the previously classified idempotents. It is shown that the equivalency of zero-divisor codes in \({\mathbf F}_2C_{n} \) with generated idempotent as generators can be established sufficiently on the generator property.
    0 references
    group ring code
    0 references
    zero-divisor code
    0 references
    idempotent
    0 references
    code equivalency
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references