Results 1  10
of
65
A Recursive Formula for Power Moments of 2Dimensional Kloosterman Sums Associated with General Linear Groups
"... ar ..."
Infinite Families of Recursive Formulas Generating Power Moments of Kloosterman Sums: O − (2n, 2 r) Case
, 901
"... In this paper, we construct eight infinite families of binary linear codes associated with double cosets with respect to certain maximal parabolic subgroup of the special orthogonal group SO − (2n,2 r). Then we obtain four infinite families of recursive formulas for the power moments of Kloosterman ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
In this paper, we construct eight infinite families of binary linear codes associated with double cosets with respect to certain maximal parabolic subgroup of the special orthogonal group SO − (2n,2 r). Then we obtain four infinite families of recursive formulas for the power moments of Kloosterman
Codes Associated with Orthogonal groups and Power Moments of Kloosterman Sums
, 808
"... Abstract In this paper, we construct three binary linear codes C(SO − (2,q)), C(O − (2,q)), C(SO − (4,q)), respectively associated with the orthogonal groups SO − (2,q), O − (2,q), SO − (4,q), with q powers of two. Then we obtain recursive formulas for the power moments of Kloosterman and 2dimensio ..."
Abstract
 Add to MetaCart
Abstract In this paper, we construct three binary linear codes C(SO − (2,q)), C(O − (2,q)), C(SO − (4,q)), respectively associated with the orthogonal groups SO − (2,q), O − (2,q), SO − (4,q), with q powers of two. Then we obtain recursive formulas for the power moments of Kloosterman and 2
Ternary Codes Associated with O − (2n, q) and Power Moments of Kloosterman Sums with Square Arguments
, 909
"... Abstract. In this paper, we construct three ternary linear codes associated with the orthogonal group O − (2, q) and the special orthogonal groups SO − (2, q) and SO − (4, q). Here q is a power of three. Then we obtain recursive formulas for the power moments of Kloosterman sums with square argument ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. In this paper, we construct three ternary linear codes associated with the orthogonal group O − (2, q) and the special orthogonal groups SO − (2, q) and SO − (4, q). Here q is a power of three. Then we obtain recursive formulas for the power moments of Kloosterman sums with square
Ternary Codes Associated with O(3, 3 r) and Power Moments of Kloosterman Sums with Trace Nonzero Square Arguments
, 2009
"... In this paper, we construct two ternary linear codes C(SO(3, q)) and C(O(3, q)), respectively associated with the orthogonal groups SO(3, q) and O(3, q). Here q is a power of three. Then we obtain two recursive formulas for the power moments of Kloosterman sums with “trace nonzero square arguments ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper, we construct two ternary linear codes C(SO(3, q)) and C(O(3, q)), respectively associated with the orthogonal groups SO(3, q) and O(3, q). Here q is a power of three. Then we obtain two recursive formulas for the power moments of Kloosterman sums with “trace nonzero square arguments
Frobenius groups of automorphisms and their xed points
"... Suppose that a finite group G admits a Frobenius group of automorphisms FH with kernel F and complement H such that the fixedpoint subgroup of F is trivial: CG(F) = 1. In this situation various properties of G are shown to be close to the corresponding properties of CG(H). By using Clifford’s theo ..."
Abstract
 Add to MetaCart
Suppose that a finite group G admits a Frobenius group of automorphisms FH with kernel F and complement H such that the fixedpoint subgroup of F is trivial: CG(F) = 1. In this situation various properties of G are shown to be close to the corresponding properties of CG(H). By using Clifford’s
Akademisk avhandling för teknisk doktorsexamen vid
, 1994
"... mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group ..."
Abstract
 Add to MetaCart
mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where
Scenario Generation and Reduction for Longterm and Shortterm Power System Generation Planning under Uncertainties
"... ii ..."
Chapter 1 Stabilization and Control over Gaussian Networks
"... Abstract We provide an overview and some recent results on realtime communication and control over Gaussian channels. In particular, the problem of remote stabilization of linear systems driven by Gaussian noise over Gaussian relay channels is considered. Necessary and sufficient conditions for mea ..."
Abstract
 Add to MetaCart
for meansquare stabilization are presented, which reveal signaltonoise ratio requirements for stabilization which are tight in certain class of settings. Optimal linear policies are constructed, global optimality and suboptimality of such policies are investigated in a variety of settings. We also
Results 1  10
of
65