Design and analysis of codes with distance 4 and 6 minimizing the probability of decoder error
- 31 Downloads
The problem of minimization of the decoder error probability is considered for shortened codes of dimension 2 m with distance 4 and 6. We prove that shortened Panchenko codes with distance 4 achieve the minimal probability of decoder error under special form of shortening. This shows that Hamming codes are not the best. In the paper, the rules for shortening Panchenko codes are defined and a combinatorial method to minimize the number of words of weight 4 and 5 is developed. There are obtained exact lower bounds on the probability of decoder error and the full solution of the problem of minimization of the decoder error probability for [39,32,4] and [72,64,4] codes. For shortened BCH codes with distance 6, upper and lower bounds on the number of minimal weight codewords are derived. There are constructed [45,32,6] and [79,64,6] BCH codes with the number of weight 6 codewords close to the lower bound and the decoder error probabilities are calculated for these codes. The results are intended for use in memory devices.
Keywordsbinary code probability of decoder error code weight spectrum
Unable to display preview. Download preview PDF.
- 2.R. Micheloni, A. Marelli, and R. Ravasio, Error Correction Codes for Non-Volatile Memories (Springer-Verlag, Qimonda Italy, 2008).Google Scholar
- 3.Yu. L. Sagalovich, “Code protection of computer random access memory from errors,” Avtom. Telemekh. 52 (5), 3–45 (1991).Google Scholar
- 8.T. Kassami, N. Tokura, E. Ivadari, and Ya. Inagaki, Coding Theory (Mir, Moscow, 1978).Google Scholar
- 11.V. I. Panchenko, “On optimization of linear code with distance 4,” in Proc. 8th All-Union Conf. on Coding Theory and Communications, Kuibyshev, 1981, Part 2: Coding Theory (Moscow, 1981), pp. 132–134 [in Russian].Google Scholar
- 14.V. D. Kolesnik, Error-Correcting Coding for Transmission and Storage of Information (Algebraic Theory of Block Codes) (Vysshaya Shkola, Moscow, 2009) [in Russian].Google Scholar
- 16.A. A. Davydov, A. Yu. Drozhzhina-Labinskaya, and L. M. Tombak, “Supplementary correcting possibilities of BCH codes, correcting double and triple errors,” in Problems of Cybernetics. Complex Engineering of Elemental and Assembly Base of Super Computer, Ed. by V. A. Mel’nikov and Yu. I. Mitropol’skii (VINITI, Moscow, 1988), pp. 86–112 [in Russian].Google Scholar