Fuzzy Extractor for Binary Sequence I was implementing Fuzzy Extractor on two close (noisy data). It's straight forward to use it to reconcile two close sets as per implementation given in https://www.cs.bu.edu/~reyzin/code/fuzzy.html, given contents of set are decimal number because:
 1. It compares sets, hence position of numbers in set does not matter.
 If I have two binary sequence extracted from close secrets can I use this extractor to correct two close binary sequence, say 10% of bits are mismatching?

As per documentation of Pinsketch we cannot use $0s$. Since set matters,
$[10011]$ and $[01011]$ will match as contents are same except order of $0$ and $1$.

Papers like [LLYM17] report of using Binary bit stream but I cannot find how this implementation based on works of Dodis et.al can be used here.



[LLYM17]: Xinghua Li, Jiajia Liu, Qingsong Yao, Jianfeng Ma, Efficient and Consistent Key Extraction Based on Received Signal Strength for Vehicular Ad Hoc Networks, in IEEE Access 2017.
You can use pin sketch. Consider the set of number [0,1,2,3,4,5,6,7]. The presence of a number can represent the presence of a 1 at that bit position in an 8 bit number.

E.G.

[0,2,4,6] == 10101010 == 0x55

[0,1,2,3] == 11110000 == 0xF0

Extend to a useful size (like 2040 bits which maps nicely to a BCH code) and you are comparing sets that have on average 1020 unique values, each showing the positions of the ones.