Nice!

Indeed, i like it, although the tones are a little too shrill, but it works.

Though if i were to do it, i'd probably use huffman encoding, put the codes as a static picture and you could decode it, it would probably have a continuous run of dots and dashes you'd have to decode. Course VLE it wouldn't need pauses between characters.

Problem is, Huffman encoding isn't universally recognised, I needed something that everyone would instantly understand.

Who cares? As long as the key is available and you can decode it. I would also have a video example of how a phrase is turned into a tree and it's encoded/decoded, if i can find that visualization library again.

As mentioned you don't need pauses between letters with huffman. which makes it a bit more efficient. But when the characters have the same-ish weight (number of times they are used) then it becomes closer to just a 4-5 bit binary encoding.

Could also encode a key as a number and throw it out there. You'd need bc or some sufficient calculator to figure it out.

Or i could encrypt a key using a previous cipher i've mentioned and leave people to compile or figure it out...

Anything is possible if you can run Quake on an oscilloscope
https://www.youtube.com/watch?v=aMli33ornEU