Error Detecting Code Optimization for Feedback Systems

  • Torleiv Kløve
  • Valery I. Korzhik
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 335)


Let us consider the following formulation of the main problem considered in this chapter. We assume given some discrete channel (in the general case non-symmetric and with memory), a required reliability (e.g. bound on Peq or P av , and some ARQ protocol. We define the optimal error detecting code for the feedback system as the code which provides the highest throughput efficiency (TE) under the given conditions. As has been explained in Chapter 3, not all codes are proper for the BSC. A similar situation may occur for other channels, with a “less noisy” channel giving a higher P1e. This is an undesirable situation. Therefore we introduce another condition: the code should provide the given reliability for any better states of the channel (for example for the BSCp, the provided reliability should be provided for any BSCp’ where p’ ≤ p.


Code Rate Code Optimization Require Reliability Symbol Error Probability Code Gain 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1995

Authors and Affiliations

  • Torleiv Kløve
    • 1
  • Valery I. Korzhik
    • 2
  1. 1.Department of InformaticsUniversity of BergenBergenNorway
  2. 2.St. Petersburg University of TelecommunicationsSt. PetersburgRussia

Personalised recommendations