-
Notifications
You must be signed in to change notification settings - Fork 0
/
generatecodes.cpp
59 lines (43 loc) · 1.23 KB
/
generatecodes.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
template<unsigned int N>
vector<int> corrCode(bitset<N> bits){
vector<int> input(bits.size());
vector<int> output(input.size(), 0);
for(size_t i = 0; i != input.size(); i++)
input[i] = bits[i];
for(size_t i = 0; i != input.size(); i++){
for(size_t j = 0; j!= input.size(); j++){
output[i] += input[j]*input[(j+i)%input.size()];
}
}
int min = *(min_element(output.begin(), output.end()));
for(size_t i = 0; i != output.size(); i++)
output[i] -= min;
return output;
}
int main(){
const unsigned int codesize = 8;
set< vector<int> > foundcodes;
for(unsigned long i = 1; i < pow(2,codesize) - 1; i++){
bitset<codesize> code = i;
vector<int> ccode = corrCode<codesize>(code);
if (foundcodes.find(ccode) == foundcodes.end()){
cout << i << ":\t";
for (size_t x = 0; x!= code.size(); x++)
cout << code[x] << " ";
cout << "\t";
for (size_t x = 0; x!= ccode.size(); x++)
cout << ccode[x] << " ";
cout << endl;
foundcodes.insert(ccode);
}
}
cout << "Number of codes: " << foundcodes.size() << endl;
return 0;
}