Sciweavers

1016 search results - page 82 / 204
» Linear error-block codes
Sort
View
GLOBECOM
2007
IEEE
14 years 2 months ago
Ensemble Enumerators for Protograph-Based Generalized LDPC Codes
— Protograph-based LDPC codes have the advantages of a simple design (or search) procedure and highly structured encoders and decoders. These advantages have also been exploited ...
Shadi Abu-Surra, William E. Ryan, Dariush Divsalar
GLOBECOM
2007
IEEE
14 years 2 months ago
Overlapped Alamouti Codes
—In most of the existing space–time code designs, achieving full diversity is based on maximum-likelihood (ML) decoding at the receiver that is usually computationally expensiv...
Yue Shang, Xiang-Gen Xia
CORR
2007
Springer
149views Education» more  CORR 2007»
13 years 8 months ago
Competitive minimax universal decoding for several ensembles of random codes
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
Yaniv Akirav, Neri Merhav
PCM
2005
Springer
123views Multimedia» more  PCM 2005»
14 years 1 months ago
Adaptive Vertex Chasing for the Lossless Geometry Coding of 3D Meshes
We present a new lossless geometry coding method for 3D triangle-quad meshes, Adaptive Vertex Chasing. Previous localized geometry coding methods have demonstrated better compressi...
Haeyoung Lee, Sujin Park
CORR
2007
Springer
84views Education» more  CORR 2007»
13 years 8 months ago
MMSE Optimal Algebraic Space-Time Codes
—Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs...
G. Susinder Rajan, B. Sundar Rajan