Group Codes over Algebra of Wreath Products

In this paper, the hyperoctahedral group algebra \(\mathscr{F}[\overrightarrow{S_{n}}]\) over a splitting field \(\mathscr{F}\) of wreath product \(\overrightarrow{S_{n}}\) with \(\text{char}(\mathscr{F})\nmid|\overrightarrow{S_{n}}|\), is considered and the unique idempotents corresponding to the four linear characters of the group \(\overrightarrow{S_{n}}\) are explored. Also, by establishing the minimum weights and dimensions, all group codes generated by the linear idempotents in the aforementioned group algebra are completely characterized for every \(n\). The nonlinear idempotents corresponding to nonlinear characters of \(\overrightarrow{S_{3}}\) are also obtained and various group codes in \(\mathscr{F}[\overrightarrow{S_{3}}]\) generated by linear and nonlinear idempotents are examined.

Authors

Publication Details

Journal
Journal of Combinatorial Mathematics and Combinatorial Computing
Published
2025-03-16
DOI
https://doi.org/10.61091/jcmcc124-07
Citations
1
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Group Codes over Algebra of Wreath Products

Madhu Dadhwal, Pankaj
1 citations
Journal of Combinatorial Mathematics and Combinatorial Computing
Coding theory and cryptography
2.48
article

Group Codes over Algebra of Wreath Products

Madhu Dadhwal, Pankaj
article en
1 citations

Abstract

In this paper, the hyperoctahedral group algebra \(\mathscr{F}[\overrightarrow{S_{n}}]\) over a splitting field \(\mathscr{F}\) of wreath product \(\overrightarrow{S_{n}}\) with \(\text{char}(\mathscr{F})\nmid|\overrightarrow{S_{n}}|\), is considered and the unique idempotents corresponding to the four linear characters of the group \(\overrightarrow{S_{n}}\) are explored. Also, by establishing the minimum weights and dimensions, all group codes generated by the linear idempotents in the aforementioned group algebra are completely characterized for every \(n\). The nonlinear idempotents corresponding to nonlinear characters of \(\overrightarrow{S_{3}}\) are also obtained and various group codes in \(\mathscr{F}[\overrightarrow{S_{3}}]\) generated by linear and nonlinear idempotents are examined.

Journal of Combinatorial Mathematics and Combinatorial ComputingVol. 124
Openalex Percentile: Top 11%
Coding theory and cryptography
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Group Codes over Algebra of Wreath Products — Madhu Dadhwal, Pankaj · Journal of Combinatorial Mathematics and Combinatorial Computing (2025) | TGRS Research Map | TGRS