Group Character Code Construction

• Group character code construction is a method that uses finite group representations and character theory to build block and convolutional codes with optimal parameters.
• It leverages additive and multiplicative characters to design codebooks and sequence sets with near-optimal correlation and distance properties for applications such as error correction and compressed sensing.
• The approach extends to nonabelian groups and finite rings, enabling explicit parity-check matrix construction and efficient computation of code parameters.

Group character code construction refers to a set of algebraic methods for building codes—block codes, convolutional codes, complex codebooks, and sequence sets—whose codewords are defined and analyzed using the character theory of finite groups, group rings, or local/finite rings. These constructions leverage intrinsic group symmetries, additive and multiplicative characters, and group algebra decompositions to produce families of codes and codebooks possessing optimal or near-optimal correlation, distance, or cross-correlation properties. Applications span error correction, compressed sensing, and signal design for wireless communications.

1. Algebraic and Representation-Theoretic Foundations

Group character code construction utilizes the representation theory of finite groups and the structure of group algebras. Given a finite group $G$ and a field $F$ of characteristic coprime to $|G|$, the group algebra $FG$ decomposes via the Wedderburn–Artin theorem:

$FG \cong \bigoplus_{i=1}^t M_{n_i}(D_i),$

where each $D_i$ is a finite-dimensional division algebra over $F$, and $M_{n_i}(D_i)$ denotes the $n_i \times n_i$ matrix ring. Orthogonal primitive (central) idempotents in $FG$ correspond to irreducible representations or strong Shoda pairs, projecting onto minimal left ideals that form the generator spaces of group codes. The connection to character theory arises as each such idempotent can be constructed from irreducible characters via

$F$0

where $F$1 is an irreducible character of $F$2 (Olteanu et al., 2013).

For abelian groups and codes over finite fields, additive and multiplicative characters yield a basis for the space of functions $F$3, facilitating code construction with tractable algebraic properties.

2. Group Character Block Codes and Their Minimum Distance

A central example is the family of group character block codes over an abelian group $F$4. For $F$5 (order $F$6, exponent $F$7) and field $F$8 with $F$9, the set of $|G|$0-valued group characters $|G|$1 forms a basis. Selecting a subset $|G|$2, the code

$|G|$3

admits a parity-check matrix $|G|$4 with $|G|$5-entry $|G|$6, $|G|$7, and dimension $|G|$8. The minimum distance $|G|$9 satisfies $FG$0 the minimum Hamming weight among nontrivial linear combinations of $FG$1 columns. For $FG$2, taking $FG$3 yields a code closely related to Reed–Muller families, with explicit dimension and distance formulas (Guardia, 2012).

Non-abelian minimal left group codes are constructed using strong Shoda pair theory and primitive idempotents in the group algebra, yielding minimal codes with parameters determined by the group structure and dimension formulas:

$FG$4

where $FG$5 is a primitive idempotent corresponding to summand $FG$6. This approach enables the construction of codes over nonabelian groups with parameters unattainable by purely abelian or cyclotomic methods (Olteanu et al., 2013).

3. Codebook Constructions via Group Characters and Character Sums

A key application of group character methods is the construction of complex codebooks for compressed sensing, multiple access, and related applications. Two principal frameworks have emerged:

• Finite Field Character Sums: Lu et al. provide six classes of asymptotically optimal complex codebooks indexed by algebraic relations over finite fields, with codewords built from normalized tuples of additive and multiplicative character evaluations. The inner products between codewords are bounded by nontrivial Gauss and Jacobi sums, whose magnitudes (typically $FG$7) control cross-correlation and asymptotic Welch-optimality as $FG$8 (Lu et al., 2019).
• Group Characters over Finite Rings/Local Rings: Qian, Cao, Lu, and Wu extend the framework to local rings $FG$9 ($FG \cong \bigoplus_{i=1}^t M_{n_i}(D_i),$0), constructing codebooks using the complete set of additive and multiplicative characters afforded by the ring's structure. The interplay of group actions and character theory enables explicit evaluation and tight bounding of inner products. Two families, $FG \cong \bigoplus_{i=1}^t M_{n_i}(D_i),$1 and $FG \cong \bigoplus_{i=1}^t M_{n_i}(D_i),$2, realize codebooks with novel $FG \cong \bigoplus_{i=1}^t M_{n_i}(D_i),$3 parameters and asymptotic Welch optimality; e.g., $FG \cong \bigoplus_{i=1}^t M_{n_i}(D_i),$4 achieves $FG \cong \bigoplus_{i=1}^t M_{n_i}(D_i),$5, $FG \cong \bigoplus_{i=1}^t M_{n_i}(D_i),$6, and $FG \cong \bigoplus_{i=1}^t M_{n_i}(D_i),$7 (Qian et al., 2019).

Orthogonality relations among characters and the precise evaluation of Gauss or Jacobi sums underlie the tight correlation control in these codebooks.

Paper/Approach	Domain	Family Parameters	Correlation Control
Lu et al. 2019 (Lu et al., 2019)	$FG \cong \bigoplus_{i=1}^t M_{n_i}(D_i),$8	6 parameter families, $FG \cong \bigoplus_{i=1}^t M_{n_i}(D_i),$9	Orthogonality, Gauss/Jacobi sums
Qian–Cao–Lu–Wu (Qian et al., 2019)	$D_i$0	$D_i$1, $D_i$2 with $D_i$3	Ring characters, Gauss sums

4. Convolutional Codes Derived from Group Character Codes

Piret’s method allows the lifting of block codes with group character-based algebraic structure to convolutional codes, by partitioning the block code’s parity-check matrix and constructing a polynomial generator matrix

$D_i$4

whose row-degrees, memory, and overall constraint length derive from the structure of nested character codes. Specifically, for $D_i$5, one obtains convolutional codes with parameters directly related to the combinatorics of subsets defined via Hamming weight and the ranks of submatrices in the character code construction. As shown in (Guardia, 2012), for $D_i$6, such codes can outperform classically constructed BCH-based convolutional codes in free distance and rate.

Key properties include:

• Guaranteed non-catastrophic encoders (generator matrices admit polynomial right inverses).
• Explicit free-distance bounds based on the dual code's parameters.
• Extendability to multi-memory codes via further partitioning and nesting of character-derived block codes.

5. Sequence Construction using Additive Characters: Complementary Codes

Advanced sequence families such as complete complementary codes (CCC) and Z-complementary code sets (ZCCS) also admit group character-based constructions. Using additive characters over Galois fields $D_i$7, code blocks and sequences with ideal aperiodic cross-correlation and autocorrelation properties are formed, with lengths and set-sizes unattainable by Boolean-function methods. For instance, in (Ghosh et al., 2024), every $D_i$8, $D_i$9, and prime factorization $F$0, CCC and ZCCS are constructed via functions

$F$1

with generalizations to interleaved structures of length $F$2. The orthogonality of additive characters ensures the vanishing of correlation sums except at prescribed shifts and blocks, attaining optimality bounds for both CCC and ZCCS parameters.

This approach provides arbitrary-length flexibility, optimal set-sizes (attaining the $F$3 ZCCS bound), and unifies many previous constructions as special cases.

6. Algorithmic and Complexity Aspects

The practical instantiation of group character codes involves:

• Enumeration of strong Shoda pairs or character orbits for nonabelian groups (Olteanu et al., 2013).
• Construction of parity-check or generator matrices through evaluation of characters on group elements or ring units.
• Explicit calculation (or computational bounding) of code parameters, including dimension, minimum distance, and cross-correlation.

For nonabelian left group code construction, steps include finding all strong Shoda pairs, computing relevant cyclotomic classes, forming explicit matrix-unit idempotents, and assembling generator matrices of minimal left ideals. Polynomial-time complexity (in group size and field order) is achievable for moderate group sizes.

Ring-based and field-based codebook constructions benefit from closed-form evaluations of character sums, greatly reducing computational overhead in correlation analyses.

7. Applications, Impact, and Extensions

Group character code constructions underpin high-performance codes and codebooks for:

• Error correction (block and convolutional codes with improved free distance).
• Sensing matrices and compressed sensing (asymptotically optimal complex codebooks).
• Wireless communications (CCC/ZCCS for MC-CDMA and interference minimization).

The systematic use of group/ring structure and character theory has generated new parameter families distinct from cyclotomic or traditional combinatorial designs, expanded the landscape of achievable code parameters, and improved performance bounds in multiple domains (Lu et al., 2019, Qian et al., 2019, Ghosh et al., 2024).

Further research explores extensions to more general rings, algebraic curves, higher-dimensional tori, and other group-theoretic frameworks, with an emphasis on flexible length, alphabet size, and practical decoding optimization. Open questions include hybrid constructions combining Boolean and character-theoretic methods, and efficient implementation in high-speed applications.