Sciweavers

2621 search results - page 4 / 525
» Near orders and codes
Sort
View
STTT
2010
97views more  STTT 2010»
13 years 6 months ago
Distributed dynamic partial order reduction
Abstract. Runtime (dynamic) model checking is a promising verification methodology for real-world threaded software because of its many features, the prominent ones being: (i) it ...
Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Rob...
APPT
2009
Springer
14 years 3 months ago
Computational Performance of a Parallelized Three-Dimensional High-Order Spectral Element Toolbox
In this paper, a comprehensive performance review of an MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance...
Christoph Bosshard, Roland Bouffanais, Christian C...
TIT
2008
135views more  TIT 2008»
13 years 8 months ago
New MDS or Near-MDS Self-Dual Codes
We construct new MDS or near-MDS self-dual codes over large finite fields. In particular we show that there exists a Euclidean self-dual MDS code of length n = q over GF(q) wheneve...
T. Aaron Gulliver, Jon-Lark Kim, Yoonjin Lee
CORR
2006
Springer
97views Education» more  CORR 2006»
13 years 8 months ago
Improved Nearly-MDS Expander Codes
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that ...
Ron M. Roth, Vitaly Skachek
ICC
2008
IEEE
14 years 2 months ago
Unveiling Near-Capacity Code Design: The Realization of Shannon's Communication Theory for MIMO Channels
— In this contribution we show how Shannon’s coding theory could be realized for Multiple-Input Multiple-Output (MIMO) channels with the aid of EXtrinsic Information Transfer (...
Soon Xin Ng, Jin Wang, Lajos Hanzo