The duals of MMD codes are proper for error detection

A linear code, when used for error detection on a symmetric channel, is said to be proper if the corresponding undetected error probability increases monotonically in /spl epsiv/, the symbol error probability of the channel. Such codes are generally considered to perform well in error detection. A number of well-known classes of linear codes are proper, e.g., the perfect codes, MDS codes, MacDonald's codes, MMD codes, and some Near-MDS codes. The aim of this work is to show that also the duals of MMD codes are proper.

[1]  Shu Lin,et al.  On the Probability of Undetected Error for the Maximum Distance Separable Codes , 1984, IEEE Trans. Commun..

[2]  Martin E. Hellman,et al.  Concerning a bound on undetected error probability (Corresp.) , 1976, IEEE Trans. Inf. Theory.

[3]  S. Dodunekov,et al.  Undetected error probability performance of cyclic redundancy-check codes of 16-bit redundancy , 2000 .

[4]  Stefan M. Dodunekov,et al.  The MMD codes are proper for error detection , 2002, IEEE Trans. Inf. Theory.

[5]  Peter Kazakov,et al.  On the cyclic redundancy-check codes with 8-bit redundancy , 1998, Comput. Commun..

[6]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

[7]  Earl R. Barnes,et al.  On some properties of the undetected error probability of linear codes (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[8]  T. Klove.  Reed-Muller codes for error detection: the good, the bad, and the ugly , 1996, IEEE Trans. Inf. Theory.

[9]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[10]  Stefan M. Dodunekov,et al.  Sufficient conditions for good and proper error-detecting codes , 1997, IEEE Trans. Inf. Theory.

[11]  Torleiv Kløve,et al.  Error detecting codes - general theory and their application in feedback communication systems , 1995, The Kluwer international series in engineering and computer science.

[12]  Stefan Dodunekov,et al.  On near-MDS codes , 1994 .

[13]  Torleiv Kløve,et al.  Almost-MDS and near-MDS codes for error detection , 1997, IEEE Trans. Inf. Theory.

[14]  Wolfgang Willems,et al.  A characterization of certain Griesmer codes: MMD codes in a more general sense , 1999, IEEE Trans. Inf. Theory.

[15]  Rossitza Dodunekova,et al.  Sufficient conditions for good and proper linear error detecting codes via their duals , 1998 .

[16]  Wolfgang Willems,et al.  A Characterization of MMD Codes , 1998, IEEE Trans. Inf. Theory.

[17]  P. S. Kazakov.  Application of Polynomials to CRC and Spherical Codes , 2000 .