A Caltech Library Service

Average-Case Optimized Buffered Decoders

Berlekamp, Elwyn R. and McEliece, Robert J. (1985) Average-Case Optimized Buffered Decoders. In: The Impact of Processing Techniques on Communications. NATO ASI Series. No.91. Springer , Dordrecht, pp. 145-158. ISBN 978-94-010-8760-5.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


In many error-correction coding systems, the required decoding time is a random variable which depends on the noise severity. When there are few errors, the decoder has a relatively easy time, but when there are many errors, the decoder must work much harder. If the “many errors” situation is relatively rare, the average decoding time may be much less than the maximum decoding time. If this is so, it will be possible to increase the decoder’s effective speed dramatically, through the use of a buffered decoder architecture.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 1985 Martinus Nijhoff Publishers, Dordrecht. We wish to thank Bruce Hajek for showing us the Kinqman bound, and Eugene Rodemich for help with the crucial Lemma 2.
Series Name:NATO ASI Series
Issue or Number:91
Record Number:CaltechAUTHORS:20200205-082507132
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:101133
Deposited By: Tony Diaz
Deposited On:06 Feb 2020 18:20
Last Modified:16 Nov 2021 17:59

Repository Staff Only: item control page