Linear block codes for error detection (Corresp.) Page 1 IEEE TRANSACTIONS ON
INFORMATION THEORY, VOL. IT-29, NO. 1, JANUARY 1983 131 Linear Block Codes for Error …

A recent paper [1] discussed the 2^{-p} bound (where p= nk) for the probability of undetected
error P (\epsilon) for an (n, k) block code used for error detection on a binary symmetric …

In the past, it has generally been assumed that the probability of undetected error for an (n,
k) block code, used solely for error detection on a binary symmetric channel, is …

The problem considered is the calculation of the probability of undetected error for linear
binary block codes used solely for error detection. Certain codes are shown to be optimal for …

The problem of computing the probability of undetected error is considered for linear block
codes used for error detection. The recent literature is first reviewed and several results are …

The problem of determining the error detection capabilities of linear codes where the
channel is a binary symmetric channel is addressed. Necessary conditions are given on the …

Sufficient Conditions For Good And Proper Error-detecting Codes - Information Theory, IEEE
Transactions on Page 1 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 43, NO. 6 …

The (n/2)-out-of-n code is proved to be the least redundant binary block code which permits
the detection of all errors in completely asymmetric channels. It is then proved that the sum …

The error detecting capability of Reed-Muller codes is analyzed. If a block code is used for
error detection only, then an error is undetectable if it transforms a codeword into another …

The undetected error probability of binary constant weight codes on a binary symmetric
channel is studied in this correspondence. First, we present a necessary condition for the …