Upper bounds on the rate of LDPC codes for Gilbert-Elliott channels
Grover, P.
Chaturvedi, A.K.
Indian Inst. of Technol., Kanpur, India;
This paper appears in: Information Theory Workshop, 2004. IEEE
Publication Date: 24-29 Oct. 2004
On page(s): 230- 235
ISSN:
ISBN: 0-7803-8720-1
INSPEC Accession Number: 8263990
Digital Object Identifier: 10.1109/ITW.2004.1405305
Current Version Published: 2005-03-14
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 the 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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
