Engineering topics
Publications and source records attributed to Berlekamp, E. R..
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.
Error correcting codes decoding by solving algebraic equations over finite fields
Lower bounds to minimum error probability for block coding on noisy discrete memoryless channels
Sequential decoding algorithm with memoryless channel, obtaining lower bound to distribution of computation and limiting factor
Lower bounds to minimum error probability using block coding on noisy discrete memoryless communication channels
Distribution of matrices resulting from Newtons identities in field of characteristic two - decoding