Sciweavers

11 search results - page 1 / 3
» An Improved Sphere-Packing Bound for Finite-Length Codes Ove...
Sort
View
TIT
2008
90views more  TIT 2008»
13 years 4 months ago
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
Gil Wiechman, Igal Sason
ICC
2008
IEEE
125views Communications» more  ICC 2008»
13 years 11 months ago
Iteratively Detected Sphere Packing Modulated OFDM: An Exit Chart Perspective
- A novel iteratively detected Sphere Packing (SP) modulation aided Orthogonal Frequency Division Multiplexing (OFDM) scheme is proposed, which we refer to as the SPOFDM arrangemen...
Lei Xu, Mohammed El-Hajjar, Osamah Alamri, Sheng C...
ICC
2009
IEEE
146views Communications» more  ICC 2009»
13 years 2 months ago
On Construction of Moderate-Length LDPC Codes over Correlated Erasure Channels
The design of moderate-length erasure correcting low-density parity-check (LDPC) codes over correlated erasure channels is considered. Although the asymptotic LDPC code design rema...
Gianluigi Liva, Balázs Matuz, Zoltán...
TIT
2002
86views more  TIT 2002»
13 years 4 months ago
A low-rate bound on the reliability of a quantum discrete memoryless channel
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel (DMC) to its quantum counterpart. The key observation that...
Alexander Barg
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 5 months ago
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
Igal Sason, Idan Goldenberg