Lexicographic code: Difference between revisions

Revision as of 14:42, 6 March 2022

Revision as of 14:47, 6 March 2022

Line 807:

#define D 8 // D bits distance

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

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

{ // lexicodes.Scan all previous

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

if( (pc( z[k]^i ) < D) // is wayReverse faster...cheking

break; // is way faster...

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