N 78 alist-to-pchk.c || fscanf(af,"%d",&N)!=1 || N<1
N 79 alist-to-pchk.c || fscanf(af,"%d",&mxrw)!=1 || mxrw<0 || mxrw>N
N 87 alist-to-pchk.c { if (fscanf(af,"%d",&rw[i])!=1 || rw[i]<0 || rw[i]>N)
N 92 alist-to-pchk.c cw = (int *) chk_alloc (N, sizeof *cw);
N 94 alist-to-pchk.c for (j = 0; j<N; j++)
N 100 alist-to-pchk.c H = mod2sparse_allocate(M,N);
N 108 alist-to-pchk.c { if (nxt<=0 || nxt>N || mod2sparse_find(H,i,nxt-1))
N 117 alist-to-pchk.c for (j = 0; j<N; j++)
N 134 alist-to-pchk.c H = mod2sparse_allocate(N,M);
N 58 check.c int N /* Number of bits */
N 65 check.c for (j = 0; j<N; j++)
N 111 check.c int N /* Length of codeword */
N 119 check.c for (j = 0; j<N; j++)
N 135 check.c int N /* Length of codeword */
N 143 check.c for (j = 0; j<N; j++)
N 163 check.c int N /* Length of codeword */
N 170 check.c for (j = 0; j<N; j++)
N 69 dec.c if (N-M>31)
N 72 dec.c N-M);
N 96 dec.c if (N-M>31) abort();
N 102 dec.c { bpr = chk_alloc (N, sizeof *bpr);
N 105 dec.c cblk = chk_alloc (N, sizeof *cblk);
N 108 dec.c { u = mod2dense_allocate(N-M,1);
N 117 dec.c lk0 = chk_alloc (N, sizeof *lk0);
N 118 dec.c lk1 = chk_alloc (N, sizeof *lk1);
N 122 dec.c for (j = 0; j<N; j++)
N 130 dec.c { for (j = 0; j<N; j++) bpr[j] = 0.0;
N 137 dec.c for (d = 0; d<=(1<<(N-M))-1; d++)
N 141 dec.c for (i = N-M-1; i>=0; i--)
N 165 dec.c for (j = 0; j<N; j++)
N 173 dec.c { for (j = 0; j<N; j++)
N 183 dec.c { for (j = 0; j<N; j++)
N 201 dec.c { for (j = 0; j<N; j++) bpr[j] /= tpr;
N 208 dec.c { for (j = 0; j<N; j++)
N 220 dec.c return 1<<(N-M);
N 259 dec.c int N, n, c;
N 261 dec.c N = mod2sparse_cols(H);
N 276 dec.c block_no, n, changed(lratio,dblk,N), c, loglikelihood(lratio,dblk,N),
N 277 dec.c expected_parity_errors(H,bprb), expected_loglikelihood(lratio,bprb,N),
N 278 dec.c entropy(bprb,N));
N 303 dec.c int N;
N 306 dec.c N = mod2sparse_cols(H);
N 308 dec.c for (j = 0; j<N; j++)
N 332 dec.c int N, M;
N 336 dec.c N = mod2sparse_cols(H);
N 361 dec.c for (j = 0; j<N; j++)
N 155 decode.c if (N<=M)
N 157 decode.c "Number of bits (%d) should be greater than number of checks (%d)\n",N,M);
N 191 decode.c { bsc_data = chk_alloc (N, sizeof *bsc_data);
N 195 decode.c { awn_data = chk_alloc (N, sizeof *awn_data);
N 205 decode.c dblk = chk_alloc (N, sizeof *dblk);
N 206 decode.c lratio = chk_alloc (N, sizeof *lratio);
N 208 decode.c bitpr = chk_alloc (N, sizeof *bitpr);
N 240 decode.c for (i = 0; i<N; i++)
N 270 decode.c { for (i = 0; i<N; i++)
N 277 decode.c { for (i = 0; i<N; i++)
N 283 decode.c { for (i = 0; i<N; i++)
N 314 decode.c chngd = changed(lratio,dblk,N);
N 331 decode.c blockio_write(df,dblk,N);
N 336 decode.c { for (j = 0; j<N; j++)
N 355 decode.c 100.0*(double)tot_changed/(N*block_no));
N 53 enc.c for (j = M; j<N; j++)
N 94 enc.c for (j = M; j<N; j++)
N 100 enc.c for (j = M; j<N; j++)
N 132 enc.c for (j = M; j<N; j++)
N 88 encode.c if (N<=M)
N 91 encode.c N,M);
N 102 encode.c { u = mod2dense_allocate(N-M,1);
N 127 encode.c sblk = chk_alloc (N-M, sizeof *sblk);
N 128 encode.c cblk = chk_alloc (N, sizeof *cblk);
N 137 encode.c if (blockio_read(srcf,sblk,N-M)==EOF)
N 171 encode.c blockio_write(encf,cblk,N);
N 178 encode.c "Encoded %d blocks, source block size %d, encoded block size %d\n",n,N-M,N);
N 79 extract.c cblk = chk_alloc (N, sizeof *cblk);
N 85 extract.c if (blockio_read(codef,cblk,N)==EOF) break;
N 90 extract.c for (i = M; i<N; i++)
N 101 make-gen.c if (N<=M)
N 103 make-gen.c "Can't encode if number of bits (%d) isn't greater than number of checks (%d)\n",N,M);
N 117 make-gen.c cols = chk_alloc (N, sizeof *cols);
N 157 make-gen.c DH = mod2dense_allocate(M,N);
N 159 make-gen.c B = mod2dense_allocate(M,N-M);
N 160 make-gen.c G = mod2dense_allocate(M,N-M);
N 188 make-gen.c A = mod2dense_allocate(M,N);
N 189 make-gen.c A2 = mod2dense_allocate(M,N);
N 228 make-gen.c { for (j = 0; j<N-M; j++)
N 244 make-gen.c for (i = M; i<N; i++)
N 264 make-gen.c intio_write(f,N);
N 266 make-gen.c for (i = 0; i<N; i++)
N 289 make-gen.c U = mod2sparse_allocate(M,N);
N 310 make-gen.c for (i = M; i<N; i++) cB += mod2sparse_count_col(H,cols[i]);
N 323 make-gen.c intio_write(f,N);
N 325 make-gen.c for (i = 0; i<N; i++)
N 63 make-ldpc.c || !argv[3] || sscanf(argv[3],"%d%c",&N,&junk)!=1 || N<=0
N 110 make-ldpc.c if (distrib_max(d)==M && N>1 && no4cycle)
N 167 make-ldpc.c H = mod2sparse_allocate(M,N);
N 168 make-ldpc.c part = column_partition(d,N);
N 179 make-ldpc.c for (j = 0; j<N; j++)
N 217 make-ldpc.c for (j = 0; j<N; j++)
N 268 make-ldpc.c { j = rand_int(N);
N 273 make-ldpc.c if (mod2sparse_at_end(mod2sparse_next_in_row(e)) && N>1)
N 275 make-ldpc.c { j = rand_int(N);
N 301 make-ldpc.c if (all_even && N-n_full>1 && added<2)
N 306 make-ldpc.c j = rand_int(N);
N 323 make-ldpc.c for (j = 0; j<N; j++)
N 48 make-pchk.c || !argv[3] || sscanf(argv[3],"%d%c",&N,&junk)!=1 || N<=0)
N 58 make-pchk.c H = mod2sparse_allocate(M,N);
N 64 make-pchk.c if (i>=M || j>=N)
N 50 mod2convert-test.c for (i = 0; i<N; i++)
N 782 mod2sparse.c int M, N;
N 786 mod2sparse.c N = mod2sparse_cols(m);
N 790 mod2sparse.c for (j = 0; j<N; j++)
N 968 mod2sparse.c int M, N;
N 975 mod2sparse.c N = mod2sparse_cols(A);
N 978 mod2sparse.c || mod2sparse_cols(U)!=N || mod2sparse_rows(U)!=K)
N 984 mod2sparse.c if (abandon_number>N-K)
N 990 mod2sparse.c cinv = chk_alloc (N, sizeof *cinv);
N 1005 mod2sparse.c B = mod2sparse_allocate(M,N);
N 1019 mod2sparse.c for (j = 0; j<N; j++) cols[j] = cinv[j] = j;
N 1035 mod2sparse.c for (k = i; k<N; k++)
N 1054 mod2sparse.c for (j = i; j<N; j++)
N 1078 mod2sparse.c for (j = i; j<N; j++)
N 1173 mod2sparse.c for (j = 0; j<N; j++)
N 1187 mod2sparse.c for (j = 0; j<N; j++)
N 81 pchk-to-alist.c H = mod2sparse_allocate(N,M);
N 84 pchk-to-alist.c N = mod2sparse_cols(H);
N 94 pchk-to-alist.c fprintf(af,"%d %d\n",M,N);
N 106 pchk-to-alist.c cw = (int *) chk_alloc (N, sizeof *cw);
N 109 pchk-to-alist.c for (j = 0; j<N; j++)
N 122 pchk-to-alist.c for (j = 0; j<N; j++)
N 123 pchk-to-alist.c { fprintf(af,"%d%c",cw[j],j==N-1?'\n':' ');
N 139 pchk-to-alist.c for (j = 0; j<N; j++)
N 63 print-gen.c for (j = 0; j<N; j++)
N 79 print-gen.c Ud = mod2dense_allocate(M,N);
N 111 print-gen.c for (j = 0; j<N; j++)
N 72 print-pchk.c { T = mod2sparse_allocate(N,M);
N 78 print-pchk.c { D = mod2dense_allocate(N,M);
N 85 print-pchk.c { D = mod2dense_allocate(M,N);
N 36 rcode.c int N; /* Number of columns in parity check matrix */
N 77 rcode.c N = mod2sparse_cols(H);
N 125 rcode.c N = N2;
N 128 rcode.c { if (M2!=M || N2!=N)
N 135 rcode.c cols = chk_alloc (N, sizeof *cols);
N 138 rcode.c for (i = 0; i<N; i++)
N 167 rcode.c if (mod2dense_rows(G)!=M || mod2dense_cols(G)!=N-M) goto garbled;
N 22 rcode.h extern int N; /* Number of columns in parity check matrix */
N 93 verify.c if (N<=M)
N 95 verify.c "Number of bits (%d) should be greater than number of checks (%d)\n",N,M);
N 125 verify.c sblk = chk_alloc (N-M, sizeof *sblk);
N 126 verify.c cblk = chk_alloc (N, sizeof *cblk);
N 155 verify.c if (blockio_read(codef,cblk,N)==EOF)
N 162 verify.c { if (blockio_read(srcf,sblk,N-M)==EOF)
N 183 verify.c { for (i = M; i<N; i++)
N 190 verify.c { for (i = M; i<N; i++)
N 230 verify.c (double)bit_errs/(n*(N-M)));