Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#319372] of Henry Pfister

Papers Published

  1. Kim, BH; Pfister, HD, On the joint decoding of LDPC codes and finite-state channels via linear programming, IEEE International Symposium on Information Theory - Proceedings (August, 2010), pp. 754-758, ISBN 9781424469604 [doi]
    (last updated on 2017/12/12)

    In this paper, the linear programming (LP) decoder for binary linear codes, introduced by Feldman, et al. is extended to joint-decoding of binary-input finite-state channels. In particular, we provide a rigorous definition of LP joint-decoding pseudo-codewords (JD-PCWs) that enables evaluation of the pairwise error probability between codewords and JD-PCWs. This leads naturally to a provable upper bound on decoder failure probability. If the channel is a finite-state intersymbol interference channel, then the LP joint decoder also has the maximum-likelihood (ML) certificate property and all integer valued solutions are codewords. In this case, the performance loss relative to ML decoding can be explained completely by fractional valued JD-PCWs. © 2010 IEEE.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320