Paper Info
Title
LP Decoding for Joint Source-Channel Codes and for the Non-Ergodic Polya Channel
Abstract
Abstract—Linear programming (LP) decoding of low-density parity-check codes over discrete memoryless symmetric channels was introduced by Feldman et al. in [1]. Here, we extend the LP decoding paradigm by applying it to two additional scenarios: joint source-channel (JSC) coding and decoding over the infinite- memory non-ergodic binary Polya-contagion channel. Simulation results indicate that the JSC LP decoder yields significant gains over the standard LP decoder for non-uniform sources. Simulations also show that the LP decoder for the Polya channel performs moderately well in relation to the -capacity limit. Index Terms—LP decoding, joint source-channel coding, non-
Year
DOI
Venue
2008
10.1109/LCOMM.2008.080713
Communications Letters, IEEE
Keywords
Field
DocType
binary codes,combined source-channel coding,decoding,linear codes,linear programming,parity check codes,LP decoding,discrete memoryless symmetric channels,joint source-channel codes,linear programming,low-density parity-check codes,non-ergodic binary Polya-contagion channel,LP decoding,joint source-channel coding,nonergodic Polya channel,systematic and non-systematic codes
Ergodicity,Fading,Binary code,Algorithm,Communication channel,Theoretical computer science,Real-time computing,Error detection and correction,Linear programming,Decoding methods,Mathematics,Bit error rate
Journal
Volume
Issue
ISSN
12
9
1089-7798
Citations 
PageRank 
References 
4
0.43
7
Authors
4
Name
Order
Citations
PageRank
Adam Cohen140.43
Fady Alajaji292.59
Kashyap, Navin3444.94
Glen Takahara4231.60