On the inherent intractability of certain coding problems

The fact that the general decoding problem for linear codes and the general problem of finding the weights of a linear code are both NP-complete is shown. This strongly suggests, but does not rigorously imply, that no algorithm for either of these problems which runs in polynomial time exists

Key papers in the development of coding theory

Includes bibliographies and index

Block coding with noiseless feedback

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering, 1964.Vita.Includes bibliographical references (1eaves 153-157).by Elwyn Ralph Berlekamp.Ph.D

Agebraic coding theory

xiv, 466 p.; 23 cm

Average-Case Optimized Buffered Decoders

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