mirror of
https://github.com/aicodix/code.git
synced 2026-04-27 14:30:36 +00:00
shift first then xor with generator
This commit is contained in:
parent
c90e9a6a23
commit
ca24063591
1 changed files with 8 additions and 9 deletions
|
|
@ -58,15 +58,14 @@ public:
|
|||
for (int l = K/8+1; l < N/8; ++l)
|
||||
code[l] = 0;
|
||||
for (int i = 0; i < K; ++i) {
|
||||
if (get_be_bit(code, i) != get_be_bit(code, K)) {
|
||||
for (int j = 1; j < NP; ++j)
|
||||
set_be_bit(code, K+j-1, get_be_bit(generator, j) != get_be_bit(code, K+j));
|
||||
set_be_bit(code, N-1, get_be_bit(generator, NP));
|
||||
} else {
|
||||
code[K/8] = (~mask&code[K/8]) | (mask&((code[K/8]<<1)|(code[K/8+1]>>7)));
|
||||
for (int l = K/8+1; l < (N-1)/8; ++l)
|
||||
code[l] = (code[l]<<1) | (code[l+1]>>7);
|
||||
code[(N-1)/8] <<= 1;
|
||||
bool fb = get_be_bit(code, i) != get_be_bit(code, K);
|
||||
code[K/8] = (~mask&code[K/8]) | (mask&((code[K/8]<<1)|(code[K/8+1]>>7)));
|
||||
for (int l = K/8+1; l < (N-1)/8; ++l)
|
||||
code[l] = (code[l]<<1) | (code[l+1]>>7);
|
||||
code[(N-1)/8] <<= 1;
|
||||
if (fb) {
|
||||
for (int j = 0; j <= NP; ++j)
|
||||
xor_be_bit(code, K+j, get_be_bit(generator, j+1));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue