Sciweavers

94 search results - page 4 / 19
» Partitions and Clifford algebras
Sort
View
SIAMCOMP
2000
97views more  SIAMCOMP 2000»
14 years 11 months ago
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
Clifford Bergman, Giora Slutzki
TIT
2010
105views Education» more  TIT 2010»
14 years 6 months ago
Multigroup ML decodable collocated and distributed space-time block codes
In this paper, collocated and distributed space-time block codes (DSTBCs) which admit multigroup maximum-likelihood (ML) decoding are studied. First, the collocated case is conside...
G. Susinder Rajan, B. Sundar Rajan
SODA
2012
ACM
235views Algorithms» more  SODA 2012»
13 years 2 months ago
Fast zeta transforms for lattices with few irreducibles
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...
Andreas Björklund, Mikko Koivisto, Thore Husf...
JCT
2010
81views more  JCT 2010»
14 years 10 months ago
q-Partition algebra combinatorics
We study a q-analog Qr(n, q) of the partition algebra Pr(n). The algebra Qr(n, q) arises as the centralizer algebra of the finite general linear group GLn(Fq) acting on a vector ...
Tom Halverson, Nathaniel Thiem
CORR
2007
Springer
155views Education» more  CORR 2007»
14 years 11 months ago
Algebraic Distributed Differential Space-Time Codes with Low Decoding Complexity
—The differential encoding/decoding setup introduced by Kiran et al, Oggier-Hassibi and Jing-Jafarkhani for wireless relay networks that use codebooks consisting of unitary matri...
G. Susinder Rajan, B. Sundar Rajan