Lines Matching refs:KK
42 #define KK (1023-4) /* Number of data symbols per block */
170 * are written back. NOTE! This array must be at least NN-KK elements long.
175 * maximum # of errors correctable is t_after_eras = floor((NN-KK-no_eras)/2).
186 gf bb[NN - KK + 1], gf eras_val[NN-KK], int eras_pos[NN-KK],
192 gf lambda[NN-KK + 1], s[NN-KK + 1]; /* Err+Eras Locator poly
194 gf b[NN-KK + 1], t[NN-KK + 1], omega[NN-KK + 1];
195 gf root[NN-KK], reg[NN-KK + 1], loc[NN-KK];
199 for(i=0;i<NN-KK;i++)
210 for(i=1;i<=NN-KK;i++){
213 for(j=1;j<NN-KK;j++){
218 for(i=1;i<=NN-KK;i++)
225 for(i=1;i<=NN-KK;i++) {
228 tmp = modnn(tmp + 2 * KK * (B0+i-1)*PRIM);
232 CLEAR(&lambda[1],NN-KK);
281 for(i=0;i<NN-KK+1;i++)
290 while (++r <= NN-KK) { /* r is the step number */
301 COPYDOWN(&b[1],b,NN-KK);
306 for (i = 0 ; i < NN-KK; i++) {
318 for (i = 0; i <= NN-KK; i++)
322 COPYDOWN(&b[1],b,NN-KK);
325 COPY(lambda,t,NN-KK+1);
331 for(i=0;i<NN-KK+1;i++){
340 COPY(®[1],&lambda[1],NN-KK);
371 * x**(NN-KK)). in index form. Also find deg(omega).
374 for (i = 0; i < NN-KK;i++){
385 omega[NN-KK] = A0;
401 for (i = min(deg_lambda,NN-KK-1) & ~1; i >= 0; i -=2) {
442 gf bb[NN - KK + 1];
443 gf error_val[NN-KK];
444 int error_pos[NN-KK], pos, bitpos, index, val;
475 if (pos >= NB_DATA && pos < KK) {