Paper Info
Title
Upper Bounds On The Rate Of Ldpc Codes For Gilbert-Elliott Channels
Abstract
Recently, there has been work in use of LDPC codes over channels with memory, in particular, over Gilbert-Elliott (GE) channels. In this paper, we derive expressions for upper bounds on rate of LDPC codes for reliable communication over a large class (non-oscillatory and non-inverting) of GE channels using the methods for memoryless channels.
Year
DOI
Venue
2004
10.1109/ITW.2004.1405305
2004 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS
Keywords
DocType
Citations 
upper bound,channel coding,ldpc code
Conference
4
PageRank 
References 
Authors
0.44
4
2
Name
Order
Citations
PageRank
Pulkit Grover155765.99
Ajit Kumar Chaturvedi26311.37