Lexicographic code: Difference between revisions

Revision as of 14:33, 6 March 2022

Revision as of 14:42, 6 March 2022

Line 806:

#define N 24 // N bits

#define D 8 // D bits distance

unsigned int * z = malloc(1<<2829);

for (i=j=0; i < (1<<N); i++) // Scan all previous

{ // Scan all previouslexicodes.

for(k=j-1; k >= 0; k--) // lexicodes.Reverse cheking

if( pc( z[k]^i ) < D) // Reverseis chekingway faster...

break; // is way faster...

if (k == -1) { // Add new lexicode