21 search results - page 1 / 5 » Affine Reflection Group Codes |
TIT
2008
13 years 4 months ago
2008
This paper presents a construction of Slepian group codes from affine reflection groups. The solution to the initial vector and nearest distance problem is presented for all irred...
TIT
2010
12 years 11 months ago
2010
We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes...
POPL
2003
ACM
14 years 5 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
ICS
2005
Tsinghua U.
13 years 10 months ago
2005
Tsinghua U.
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to eve...
SCCC
1999
IEEE
13 years 9 months ago
1999
IEEE
A model was introduced in [Fraga97] for integrating replication techniques in heterogeneous systems. The model adopts a reflective structure based on the meta-object approach [10]...