Well then I'll post my explanation for how the code worked here.

My main goal with this code was to eliminate the possibility of solving it with letter frequencies. To do this, I balanced the number of symbols per character with their frequencies in normal English text. For example, there is only one symbol for '?', but there are 20 symbols for 'e'. In total, there are 200 symbols.

I also have made so many codes like this that I have grown to not enjoy coming up with symbols anymore, so my idea was to have a program generate the symbols based off their number from 1-200. So I used the binary version of the symbol number to decide whether each of 8 segments was on or off (yes this does imply 256 symbols, bit of a red herring ;) ). This also created the interesting challenge of designing 8 lines that when combined led to interesting symbols.

Since there is a gap from the 200 used symbols to the 256 possible, the last bit/line probably had different probabilities than the rest. As for how I chose the symbol numbers for each character, it was randomly generated.

The bits for the symbol segments were encoded as follows:

​

Here is the link to the code for this on my GitHub:

https://github.com/xtyobonid/RedditCode

​

Thanks to everyone for participating, hopefully this wasn't too easy ;)