Mirror/aicodix___code
1
0
Fork 0
mirror of https://github.com/aicodix/code.git synced 2026-04-27 22:35:44 +00:00
Code Issues Projects Releases Packages Wiki Activity

broke the long list of minpolys

Browse source
This commit is contained in:
Ahmet Inan 2018-09-29 11:43:24 +02:00
commit 346a4a6d08
2 changed files with 20 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

12
tests/bch_encoder_test.cc
View file

@ -31,7 +31,11 @@ int main()
const int D = (BCH::K + 7) / 8;
const int P = (BCH::NP + 7) / 8;
const int L = D + P;
BCH *encode = new BCH({0b10000000000101101, 0b10000000101110011, 0b10000111110111101, 0b10101101001010101, 0b10001111100101111, 0b11111011110110101, 0b11010111101100101, 0b10111001101100111, 0b10000111010100001, 0b10111010110100111, 0b10011101000101101, 0b10001101011100011});
BCH *encode = new BCH({
0b10000000000101101, 0b10000000101110011, 0b10000111110111101,
0b10101101001010101, 0b10001111100101111, 0b11111011110110101,
0b11010111101100101, 0b10111001101100111, 0b10000111010100001,
0b10111010110100111, 0b10011101000101101, 0b10001101011100011});
uint8_t *target = new uint8_t[L];
for (int i = 0; i < L; ++i)
target[i] = 0;
@ -67,7 +71,11 @@ int main()
typedef CODE::GaloisField<16, 0b10000000000101101, uint16_t> GF;
typedef CODE::BoseChaudhuriHocquenghemEncoderReference<24, 1, 65343, GF> BCH;
GF *instance = new GF();
BCH *encode = new BCH({0b10000000000101101, 0b10000000101110011, 0b10000111110111101, 0b10101101001010101, 0b10001111100101111, 0b11111011110110101, 0b11010111101100101, 0b10111001101100111, 0b10000111010100001, 0b10111010110100111, 0b10011101000101101, 0b10001101011100011});
BCH *encode = new BCH({
0b10000000000101101, 0b10000000101110011, 0b10000111110111101,
0b10101101001010101, 0b10001111100101111, 0b11111011110110101,
0b11010111101100101, 0b10111001101100111, 0b10000111010100001,
0b10111010110100111, 0b10011101000101101, 0b10001101011100011});
BCH::value_type *code = new BCH::value_type[BCH::N];
BCH::value_type *target = new BCH::value_type[BCH::N];
for (int i = 0, s = 0; i < BCH::K; ++i, s=(s*(s*s*51767+71287)+35149)&0xffffff)