<p>Paley-type partial difference sets and skew–Hadamard difference sets are classical objects in algebraic combinatorics, known for their rich connections with graph theory, coding theory, and group theory. In this paper, we explore new links between these combinatorial structures and group codes arising as ideals in finite group algebras. We construct such codes from difference sets and determine their dimensions in several cases. As an application of our links, we explicitly compute the full set of primitive central idempotents in certain abelian <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\( p \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>p</mi> </math></EquationSource> </InlineEquation>-group algebras, by employing the classical sets of quadratic residues and non-residues modulo <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\( p \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>p</mi> </math></EquationSource> </InlineEquation>, which are well-studied examples of difference and partial difference sets—we also obtain their dimensions and estimate their minimum weights.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

On group codes arising from Paley-type partial difference sets and skew–Hadamard difference sets

  • Vitor Araujo Garcia

摘要

Paley-type partial difference sets and skew–Hadamard difference sets are classical objects in algebraic combinatorics, known for their rich connections with graph theory, coding theory, and group theory. In this paper, we explore new links between these combinatorial structures and group codes arising as ideals in finite group algebras. We construct such codes from difference sets and determine their dimensions in several cases. As an application of our links, we explicitly compute the full set of primitive central idempotents in certain abelian \( p \) p -group algebras, by employing the classical sets of quadratic residues and non-residues modulo \( p \) p , which are well-studied examples of difference and partial difference sets—we also obtain their dimensions and estimate their minimum weights.