We explore non-standard orthogonalities arising from the character table of a finite commutative group. These orthogonalities are used in algebraic coding theory to replace the standard Euclidean orthogonality and have a corresponding MacWilliams relation for them. We establish that for a finite commutative group G and any subgroups H and K of G with |H||K| = |G| that there exists an orthogonality with H = K. Additionally, we give families of orthogonalities that apply to any finite commutative group. We give numerous examples of orthogonalities for specific groups. Finally, we prove that the additive group of the finite field F22k with a symmetric duality M has a self-dual code of length 1
Let G be a permutation group on an n-element set Ω. We study the binary code C(G,Ω) defined as the d...
AbstractWe study the orthogonal group Om of m×m matrices over the field of two elements and give app...
For systematic codes over finite fields the following result is well known: If [I¦P] is the generato...
AbstractA complex character of a finite group G is called orthogonal if it is the character of a rea...
AbstractLet G be a permutation group on an n-element set Ω. We study the binary code C(G,Ω) defined ...
Let G be a permutation group on an n-element set . We study the binary code C(G;) de¯ned as the dual...
The subject of this thesis are orthogonal representations of finite groups. By this we mean a pair (...
AbstractA complex character of a finite group G is called orthogonal if it is the character of a rea...
In Chapter 2 we develop the concept of total orthogonality. A number of necessary conditions are der...
An ordinary character $\chi $ of a finite group is called orthogonally stable, if all non-degenerate...
Representation theory is concerned with the ways of writing elements of abstract algebraic structure...
AbstractWe study the character tables of the association schemes obtained from the following actions...
Representation theory is concerned with the ways of writing elements of abstract algebraic structure...
Representation theory is concerned with the ways of writing elements of abstract algebraic structure...
AbstractIf G→O(V) is an orthogonal representation of the group G, then a double cover of G is determ...
Let G be a permutation group on an n-element set Ω. We study the binary code C(G,Ω) defined as the d...
AbstractWe study the orthogonal group Om of m×m matrices over the field of two elements and give app...
For systematic codes over finite fields the following result is well known: If [I¦P] is the generato...
AbstractA complex character of a finite group G is called orthogonal if it is the character of a rea...
AbstractLet G be a permutation group on an n-element set Ω. We study the binary code C(G,Ω) defined ...
Let G be a permutation group on an n-element set . We study the binary code C(G;) de¯ned as the dual...
The subject of this thesis are orthogonal representations of finite groups. By this we mean a pair (...
AbstractA complex character of a finite group G is called orthogonal if it is the character of a rea...
In Chapter 2 we develop the concept of total orthogonality. A number of necessary conditions are der...
An ordinary character $\chi $ of a finite group is called orthogonally stable, if all non-degenerate...
Representation theory is concerned with the ways of writing elements of abstract algebraic structure...
AbstractWe study the character tables of the association schemes obtained from the following actions...
Representation theory is concerned with the ways of writing elements of abstract algebraic structure...
Representation theory is concerned with the ways of writing elements of abstract algebraic structure...
AbstractIf G→O(V) is an orthogonal representation of the group G, then a double cover of G is determ...
Let G be a permutation group on an n-element set Ω. We study the binary code C(G,Ω) defined as the d...
AbstractWe study the orthogonal group Om of m×m matrices over the field of two elements and give app...
For systematic codes over finite fields the following result is well known: If [I¦P] is the generato...