Sciweavers

164 search results - page 27 / 33
» Improved upper bounds on sizes of codes
Sort
View
TCOM
2008
105views more  TCOM 2008»
14 years 9 months ago
High-rate diversity across time and frequency using linear dispersion
To improve performance of orthogonal frequency division multiplexing (OFDM) for fading channels, this paper proposes increasing frequency and time diversity using linear dispersion...
Jinsong Wu, Steven D. Blostein
97
Voted
ECRTS
2002
IEEE
15 years 2 months ago
Scope-Tree: A Program Representation for Symbolic Worst-Case Execution Time Analysis
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
Antoine Colin, Guillem Bernat
SAC
2008
ACM
14 years 9 months ago
Removing useless variables in cost analysis of Java bytecode
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
IWCMC
2009
ACM
15 years 4 months ago
Multiple-antenna multiple-relay system with precoding for multiuser transmission
Multi-hop relaying will play a central role in next generation wireless systems. In this paper a novel relaying strategy that uses multiple-input multiple-output (MIMO) relays in ...
Arash Talebi, Witold A. Krzymien
ESOP
2001
Springer
15 years 1 months ago
Typestate Checking of Machine Code
We check statically whether it is safe for untrusted foreign machine code to be loaded into a trusted host system. (Here “safety” means that the program abides by a memory-acc...
Zhichen Xu, Thomas W. Reps, Barton P. Miller