Sciweavers

37 search results - page 5 / 8
» Iterative Decoding Performance Bounds for LDPC Codes on Nois...
Sort
View
CORR
2007
Springer
124views Education» more  CORR 2007»
13 years 7 months ago
Graph-Based Decoding in the Presence of ISI
We propose a new graph representation for ISI channels that can be used for combined equalization and decoding by linear programming (LP) or iterative message-passing (IMP) decodi...
Mohammad H. Taghavi, Paul H. Siegel
ICC
2007
IEEE
146views Communications» more  ICC 2007»
14 years 1 months ago
Optimally Mapping an Iterative Channel Decoding Algorithm to a Wireless Sensor Network
–Retransmission based schemes are not suitable for energy constrained wireless sensor networks. Hence, there is an interest in including parity bits in each packet for error cont...
Saad B. Qaisar, Shirish S. Karande, Kiran Misra, H...
CORR
2010
Springer
65views Education» more  CORR 2010»
13 years 7 months ago
Iterative method for improvement of coding and decryption
Cryptographic check values (digital signatures, MACs and H-MACs) are useful only if they are free of errors. For that reason all of errors in cryptographic check values should be ...
Natasa Zivic
TIT
2008
90views more  TIT 2008»
13 years 7 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
GLOBECOM
2006
IEEE
14 years 1 months ago
When Does One Redundant Parity-Check Equation Matter?
— We analyze the effect of redundant parity-check equations on the error-floor performance of low-density paritycheck (LDPC) codes used over the additive white Gaussian noise (A...
Stefan Laendner, Thorsten Hehn, Olgica Milenkovic,...