BCH Codes Construction

BCH codes forms a class of random multiple error-correcting cyclic codes.
For any positive

integer m = 3 and t < 2m -1, there exists a binary BCH code with the following parameters [15]:
Block length: n = 2m - 1
Number of parity-check digits: n - k = mt
Minimum distance: d = 2t + 1.
The generator polynomial g(x) of the t-error-correcting BCH code of length 2m
-1 is the lowestdegree polynomial over GF(2) which has a,a1, a2, . . , a2t as its roots. Let F(X) be the
minimal polynomial of ai. g(X) is the least common multiple (LCM) of F1(X), F2(X),.., F2t(X).
Another guideline used by some CRC schemes in practice is the ability to detect
burst errors. Let us define a burst error pattern of length b as a sequence of bits
1 b 2 b 3 . . . 11: that is, the number of bits is b, the first and last bits are both 1,
and the bits i in the middle could be either 0 or 1. The minimum burst length is 2,
corresponding to the pattern 11
Finally, all burst errors of size less than or equal to the number of bits in the CRC are detected (that
property is not the primary consideration of this work and remains intact for all the codes we consider).
If the generator polynomial is p(x) times (1+x) this finds all parity errosrs.
=1
= 000001
=1
= 63
= 126
= 189
... | x+1
= 000010
=2
= 64
= 127
= 190
... | x6+x5+1
= 2
= 000100
=4
= 65
= 128
= 191
... | x6+x5+1
= 3
= 001000
=8
= 66
= 129
= 192
... | x6+x5+x4+x2+1
= 4
= 010000
= 16 = 67
= 130
= 193
... | x6+x5+1
= 5
= 100000
= 32 = 68
= 131
= 194
... | x6+x5+x4+x+1
= 5+1
= 100001
= 33 = 69
= 132
= 195
... | x6+x5+x4+x2+1
= 5++1
= 100011
= 35 = 70
= 133
= 196
... | x6+x3+1
= 5+2++1
= 100111
= 39 = 71
= 134
= 197
... | x6+x5+1
= 5+3+2++1
= 101111
= 47 = 72
= 135
= 198
... | x3+x+1
10 = 5+4+3+2++1
= 111111
= 63 = 73
= 136
= 199
... | x6+x5+x4+x+1
11 = 4+3+2++1
= 011111
= 31 = 74
= 137
= 200
... | x6+x4+x3+x+1
12 = 5+4+3+2+
= 111110
= 62 = 75
= 138
= 201
... | x6+x5+x4+x2+1
13 = 4+3+2+1
= 011101
= 29 = 76
= 139
= 202
... | x6+x5+x3+x2+1
14 = 5+4+3+
= 111010
= 58 = 77
= 140
= 203
... | x6+x3+1
15 = 4+2+1
= 010101
= 21 = 78
= 141
= 204
... | x6+x4+x2+x+1
16 = 5+3+
= 101010
= 42 = 79
= 142
= 205
... | x6+x5+1
17 = 5+4+2+1
= 110101
= 53 = 80
= 143
= 206
... | x6+x5+x4+x+1
18 = 3++1
= 001011
= 11 = 81
= 144
= 207
... | x3+x+1
19 = 4+2+
= 010110
= 22 = 82
= 145
= 208
... | x6+x5+x3+x2+1
20 = 5+3+2
= 101100
= 44 = 83
= 146
= 209
... | x6+x5+x4+x+1
21 = 5+4+3+1
= 111001
= 57 = 84
= 147
= 210
... | x2+x+1
22 = 4++1
= 010011
= 19 = 85
= 148
= 211
... | x6+x4+x3+x+1
23 = 5+2+
= 100110
= 38 = 86
= 149
= 212
... | x6+x5+x2+x+1
24 = 5+3+2+1
= 101101
= 45 = 87
= 150
= 213
... | x6+x5+x4+x2+1
25 = 5+4+3++1
= 111011
= 59 = 88
= 151
= 214
... | x6+x4+x3+x+1
26 = 4+2++1
= 010111
= 23 = 89
= 152
= 215
... | x6+x5+x3+x2+1
27 = 5+3+2+
= 101110
= 46 = 90
= 153
= 216
... | x3+x2+1
28 = 5+4+3+2+1
= 111101
= 61 = 91
= 154
= 217
... | x6+x3+1
29 = 4+3++1
= 011011
= 27 = 92
= 155
= 218
... | x6+x5+x2+x+1
30 = 5+4+2+
= 110110
= 54 = 93
= 156
= 219
... | x6+x4+x2+x+1
31 = 3+2+1
= 001101
= 13 = 94
= 157
= 220
... | x6+x+1
32 = 4+3+
= 011010
= 26 = 95
= 158
= 221
... | x6+x5+1
33 = 5+4+2
= 110100
= 52 = 96
= 159
= 222
... | x6+x5+x4+x2+1
34 = 3+1
= 001001
=9
= 97
= 160
= 223
... | x6+x5+x4+x+1
35 = 4+
= 010010
= 18 = 98
= 161
= 224
... | x6+x3+1
36 = 5+2
= 100100
= 36 = 99
= 162
= 225
... | x3+x+1
37 = 5+3+1
= 101001
= 41 = 100
= 163
= 226
... | x6+x4+x3+x+1
38 = 5+4++1
= 110011
= 51 = 101
= 164
= 227
... | x6+x5+x3+x2+1
39 = 2++1
= 000111
=7
= 102
= 165
= 228
... | x6+x4+x2+x+1
40 = 3+2+
= 001110
= 14 = 103
= 166
= 229
... | x6+x5+x4+x+1
41 = 4+3+2
= 011100
= 28 = 104
= 167
= 230
... | x6+x5+x3+x2+1
42 = 5+4+3
= 111000
= 56 = 105
= 168
= 231
... | x2+x+1
43 = 4+1
= 010001
= 17 = 106
= 169
= 232
... | x6+x5+x2+x+1
44 = 5+
= 100010
= 34 = 107
= 170
= 233
... | x6+x4+x3+x+1
45 = 5+2+1
= 100101
= 37 = 108
= 171
= 234
... | x3+x2+1
46 = 5+3++1
= 101011
= 43 = 109
= 172
= 235
... | x6+x5+x2+x+1
47 = 5+4+2++1
= 110111
= 55 = 110
= 173
= 236
... | x6+x+1
48 = 3+2++1
= 001111
= 15 = 111
= 174
= 237
... | x6+x5+x4+x2+1
49 = 4+3+2+
= 011110
= 30 = 112
= 175
= 238
... | x6+x3+1
50 = 5+4+3+2
= 111100
= 60 = 113
= 176
= 239
... | x6+x4+x3+x+1
51 = 4+3+1
= 011001
= 25 = 114
= 177
= 240
... | x6+x4+x2+x+1
52 = 5+4+
= 110010
= 50 = 115
= 178
= 241
... | x6+x5+x3+x2+1
53 = 2+1
= 000101
=5
= 116
= 179
= 242
... | x6+x5+x2+x+1
54 = 3+
= 001010
= 10 = 117
= 180
= 243
... | x3+x2+1
55 = 4+2
= 010100
= 20 = 118
= 181
= 244
... | x6+x+1
56 = 5+3
= 101000
= 40 = 119
= 182
= 245
... | x6+x3+1
57 = 5+4+1
= 110001
= 49 = 120
= 183
= 246
... | x6+x4+x2+x+1
58 = +1
= 000011
=3
= 121
= 184
= 247
... | x6+x5+x2+x+1
59 = 2+
= 000110
=6
= 122
= 185
= 248
... | x6+x+1
60 = 3+2
= 001100
= 12 = 123
= 186
= 249
... | x6+x4+x2+x+1
61 = 4+3
= 011000
= 24 = 124
= 187
= 250
... | x6+x+1
62 = 5+4
= 110000
= 48 = 125
= 188
= 251
... | x6+x+1
63 = 1
= 000001
=1
= 126
= 189
= 252
... | x+1

BCH Codes Construction

Încărcat de

Informații document

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

BCH Codes Construction

Încărcat de

Drepturi de autor:

Formate disponibile

BCH codes forms a class of random multiple error-correcting cyclic codes.

For any positive

S-ar putea să vă placă și