If the string length is one, then you'll simply get a bunch of 1's and 0's in the output.
In the options of this tool, you can specify how many binary digits you need in each binary string and how many results you need. You can feed binary data of random length into a signal processor and test if it works correctly when it encounters unexpected random input. Another use is signal processing, where 1 indicates a high and 0 indicates a low. If your application needs to randomly selects a certain number of items from a pool of items, then if you create a random binary number, then the positions of all 1's can be used to 'pick the item' and all 0's can be used as 'don't pick the item'. Another interesting use case is combinatorics. For example, if your webapp accepts only 0's or 1's as input, then you can write a unit test that runs through binary numbers of various lengths and makes sure the app doesn't accidentally accept other numbers as input. You can specify the starting number, delta and count in the options. An arithmetic progression is a number sequence such that the difference (delta) between one term (number) and the next is a constant. A random binary string generator can be useful if you're doing cross-browser testing. This is an online browser-based utility for generating a list of numbers in arithmetic progression.
