## Sequential decoding with feedback |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

CHAPTER n BLOCK CODING WITH FEEDBACK | 7 |

APPENDIX | 15 |

SEQUENTIAL DECODING | 22 |

8 other sections not shown

### Common terms and phrases

acceptable node acceptable path p(J Appendix assumed asymptotic upper bound asymptotically average number binary digits Binary Symmetric Channel bit is bounded block codes branch leading Chapter Chernoff bounds computations per decoded convenient to define crit decision feedback decoded bit encoding ensemble of codes equiprobable event Fano Fano's algorithm Fano's sequential decoding feedback channel forward mode computation Hamming distance increasing function information rate investigated lead node leading to node Lemma lower bound Nj(k null space null threshold number of computations obtained particular node paths in Sj pcrit present threshold probability of error random coding random variable reasonable to expect received sequence repeat repeat-request strategy request a retransmission scheme Section 4.4 semi-infinite tape sequential decoding algorithm sequential decoding procedure shown statistically independent stemming from node tape head Theorem threshold in effect tree code upper bound user in error violated Wozencraft