Overview

Error detecting codes are popular for error control in practical systems for two reasons. First, such codes can be used to provide any desired reliability of communication over any noisy channel. Second, implementation is usually much simpler than for a system using error correcting codes. To consider a particular code for use in such a system, it is important to be able to calculate/estimate the probability of undetected error. For the binary symmetric channel, the probability of undetected error can be expressed in terms of the weight distribution of the code. The first part of the book gives a description of known methods to calculate or estimate the probability of undetected error, for the binary symmetric channel in particular, but a number of other channel models are also considered. The second part of the book describes a number of protocols for feedback communication systems (ARQ systems), with methods for optimal choice of error detecting codes for the protocols.

Full Product Details

Author:   Torleiv Kløve ,  Valery Korzhik
Publisher:   Springer
Imprint:   Springer
Edition:   1995 ed.
Volume:   335
Dimensions:   Width: 15.50cm , Height: 1.50cm , Length: 23.50cm
Weight:   1.220kg
ISBN:  

9780792396291

ISBN 10:   0792396294
Pages:   249
Publication Date:   30 September 1995
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

PREFACE.- 1 CHANNEL MODELS.- 1.1 Introduction.- 1.2 Channels Without Memory.- 1.3 Channels With Memory.- 1.4 Channel Transforms.- 1.5 Comments and References.- 2 BASICS ON ERROR CONTROL.- 2.1 ABC on Linear Codes.- 2.2 Weight Distributions.- 2.3 Principles of Error Detection.- 2.4 Combined Correction and Detection.- 2.5 Comments and References.- 3 ERROR DETECTING CODES FOR THE BSC.- 3.1 Basic Formulas and Bounds.- 3.2 Finding the Average.- 3.3 The Worst-Case Error Probability.- 3.4 P1e for a Linear Code and its Dual.- 3.5 General Bounds.- 3.6 Optimal Codes.- 3.7 New Codes from Old.- 3.8 Combined Correction and Detection.- 3.9 Complexity of Computing Pue(C, p).- 3.10 Particular Codes.- 3.11 How to Find the Code You Need.- 3.12 Comments and References.- 4 CODES FOR OTHER CHANNELS.- 4.1 The Z-channel.- 4.2 Channels With Memory.- 4.3 Conclusions.- 4.4 Comments and References.- 5 PROTOCOLS.- 5.1 Introduction..- 5.2 The Main Criteria of FS Efficiency.- 5.3 Basic Protocols for Decision Feedback Systems.- 5.4 Protocols With Information Feedback.- 5.5 Conclusions.- 5.6 Appendix: Signal Flow Graphs for Protocol Analysis.- 5.7 Comments and References.- 6 CODE OPTIMIZATION.- 6.1 Basic Criteria for Optimization.- 6.2 Channels Without Memory.- 6.3 Channels With Memory.- 6.4 Iterative and Concatenated Codes.- 6.5 Optimization of Protocols.- 6.6 Comments and References.- 7 CONCLUDING REMARKS.- REFERENCES.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions