Sciweavers

164 search results - page 17 / 33
» Improved upper bounds on sizes of codes
Sort
View
GLOBECOM
2008
IEEE
15 years 3 months ago
Distributed Double-Differential Orthogonal Space-Time Coding for Cooperative Networks
— In this paper, distributed double-differential coding is proposed to avoid the problem of carrier offsets in amplify and forward protocol based cooperative network with two rel...
Manav R. Bhatnagar, Are Hjørungnes
TIT
2008
102views more  TIT 2008»
14 years 9 months ago
Average Stopping Set Weight Distributions of Redundant Random Ensembles
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
Tadashi Wadayama
TIT
2010
170views Education» more  TIT 2010»
14 years 4 months ago
Correcting charge-constrained errors in the rank-modulation scheme
We investigate error-correcting codes for a the rank-modulation scheme with an application to flash memory devices. In this scheme, a set of n cells stores information in the permu...
Anxiao Jiang, Moshe Schwartz, Jehoshua Bruck
DAC
2009
ACM
15 years 10 months ago
Computing bounds for fault tolerance using formal techniques
Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g. due to environmental radiation. Approaches to implement fault tol...
André Sülflow, Görschwin Fey, Rol...
DCC
2010
IEEE
15 years 4 months ago
On Computation of Performance Bounds of Optimal Index Assignment
Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intac...
Xiaolin Wu, Hans D. Mittelmann, Xiaohan Wang, Jia ...