| 摘要 |
PROBLEM TO BE SOLVED: To select much more suitable generator polynomials, and to switch the selected plurality of generator polynomials according to data to be processed for use. SOLUTION: The maximum/minimum hamming distance (Max.d<SB>min</SB>) being the maximum value of the minimum hamming distance (d<SB>min</SB>) in each code length (n) of a code with code length (n) having k bit information words to which r bit parity is added about the information word is found, and code length n whose Max.d<SB>min</SB>is changed is found, and the n range (n<SB>min</SB>≤n≤n<SB>max</SB>) is found. In the n range, generator polynomials (G(x)) satisfying d<SB>min</SB>=Max.d<SB>min</SB>all the time are found out by full retrieval, and the generator polynomial in which the number of items (w) and the undetected error capability (P<SB>ud</SB>) of the code is the minimum is selected from among the G(x) found out by full retrieval. The plurality of generator polynomials selected in this way are switched and used according to the type or code length of data to be processed. COPYRIGHT: (C)2009,JPO&INPIT
|
