Sciweavers

2621 search results - page 1 / 525
» Near orders and codes
Sort
View
CORR
2006
Springer
83views Education» more  CORR 2006»
13 years 5 months ago
Near orders and codes
H
Cícero Carvalho, Carlos Munuera, Ercilio da...
GLOBECOM
2010
IEEE
13 years 3 months ago
An Exit-Chart Aided Design Procedure for Near-Capacity N-Component Parallel Concatenated Codes
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...
Hong Chen, Robert G. Maunder, Lajos Hanzo
TCOM
2010
107views more  TCOM 2010»
13 years 4 months ago
Near-Capacity Cooperative Space-Time Coding Employing Irregular Design and Successive Relaying
— In this paper, we develop a capacity-approaching Cooperative Space-Time Coding (CSTC) scheme employing irregular design for a twin-relay aided network as an extension of our pr...
Lingkun Kong, Soon Xin Ng, Robert G. Maunder, Lajo...
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 5 months ago
Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes
In this paper, a simple and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method co...
Enrico Paolini, Marco Chiani
CISS
2008
IEEE
14 years 6 days ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman