How to run this on Linux?

[yihanjiang]

Hi Jarek,

I am trying to run the deletion channel code to get the results for other block lengths (50, 100, 500, and 1000). I tried to compile the file but find a few compile issues. Could you offer a guideline to replicate your results? That will be super helpful for follow up researchers.

Thanks,

Yihan

[JarekDuda]

Hi Yihan,

Oh, it was so long ago. I usually work in Mathematica, only went back to C++ for these few repositories. I worked in Windows + NetBeans, I think MinGW compiler. I have no experience with C++ on Linux.
What exactly is the issue?

And generally you should add at least some information about the 64 bit final state for verification of the path - this cost needs to be included in rate, for very short blocks it becomes significant.
A better way to improve is adding bidirectional correction - simultaneously build backward tree from the end. We have implemented it for BSC ( https://indect-project.eu/correction-trees/ ), but I didn't find motivation to do it here.

Best,
Jarek