Generate Unique Random Binary Numbers with defined Hamming Distance

Hello, i'm placing this bid just to share my thoughts and my algorithm results. The biggest performance drop is caused by randomizing new number that fits the criteria (Hamming distance greater than Y, compared with elements in array). For Y that is higher than 1/4 of bits count, my algorithm becomes very slow. I.e. generating N=500 Y=5 took less than a second but Y=7 takes few minutes. My another approach involved prearranged array. Array was filled with N elements, that meet criteria, but the starting point was 1, 2, 3, 4... This reduced N=500, Y=7 time to 10 seconds but the output array become pseudo random (limited range of 1..highest N value, instead of full 24-bit range). Then i moved back to first version but split the task to multiple workers. It slightly increased the performance but it is still not really acceptable, especially if you need it to work with Y set to high (like 10 or 15). A correct solution would make use of evolutionary algorithms, but that's beyond of my "regular programmer" scope ;-) Good luck with the project!

i can do this task for you. i can do this task for you. i can do this task for you. i can do this task for you.

I'm programmer and mathematical. I can do your program in Free Pascal, this lenguaje allow to compile the same code for Windows and Linux. Free Pascal have a function to generate random number and I use this function frequently in my programs so I have experience in this kind of work. The Hamming Distance between two strings of equal length is the number of positions at which the corresponding symbols are different. In the following example the Hamming Distance between the two binary numbers is 8. 011111000110101011100101 011000100111110011101101 My idea about the program is the following: The program should allow two inputs: - Amount of random number of 24-bit binary (N) - The Hamming Distance (Y) When these values are introduced, a button can be pressed to begin the generation until to obtain all random numbers (N). During the generation, the program should compare the last number with every other number of the generated set, if this comply the Hamming Distance (Y) with all, then is incorporated at the generated set. When the generated set is completed (N numbers) the program should save a CSV file with these numbers and the format of your example. The program should allow to select the folder where this file will be saved. Regards, Mel

Dear Sir, I am TOP RANKED programmer with 10 years of experience. Please award me this projecr.

Hi I would like to work with you on this project. I can program in C#.NET which requires MONO on UNIX. I can provide tested code on Visual Studio 2015 on Windows only. I can't test on UNIX. Regards, EK

Hi I have a BS degree in CS and I have studied hamming distance and algorithms. I can create a PHP script that will work on it's own to generate the numbers, and also a separate Windows Desktop Application using Visual C#. I have excellent experience of creating custom scripts and programs. Please have a look at feedback on related projects on my profile. Looking forward to seeing your reply. Thanks. Regards Ahsan