Computing the performance of unitary space-time group codes from their character table
Publications associées (68)
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Let G be a finite group and R be a commutative ring. The Mackey algebra μR(G) shares a lot of properties with the group algebra RG however, there are some differences. For example, the group algebra is a symmetric algebra and this is not always the case fo ...
Let R be a unital commutative ring, and let M be an R-module that is generated by k elements but not less. Let be the subgroup of generated by the elementary matrices. In this paper we study the action of by matrix multiplication on the set of unimodular r ...
An acoustic processing method for M acoustic receivers comprising the steps of: Determining a beamforming weight vector with M weights for the M acoustic receivers based on at least one the steering vector of at least one real acoustic source, on steering ...
The minimal faithful permutation degree (G) of a finite group G is the least nonnegative integer n such that G embeds in the symmetric group Sym(n). Clearly (G x H) (G) + (H) for all finite groups G and H. In 1975, Wright ([10]) proved that equality occurs ...
For G a simple algebraic group over an algebraically closed field of characteristic 0, we determine the irreducible representations ρ:G→I(V), where I(V) denotes one of the classical groups SL(V), Sp(V), SO(V), such that ρ sends some distinguished unipotent ...
Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem (DLP) in finite groups whose group representation is not yet exploited. For such groups, the best one can do is using a generic method to attack the DLP, the fastest ...
We prove a Szemeredi-Trotter type theorem and a sum product estimate in the setting of finite quasifields. These estimates generalize results of the fourth author, of Garaev, and of Vu. We generalize results of Gyarmati and Sarkozy on the solvability of th ...
We present a more concise formulation of the transformation based synthesis approach for reversible logic synthesis, which is one of the most prominent explicit ancilla-free synthesis approaches. Based on this formulation we devise a symbolic variant of th ...
We show that the first -Betti number of the duals of the free unitary quantum groups is one, and that all -Betti numbers vanish for the duals of the quantum automorphism groups of full matrix algebras. ...