I think past!me miscommunicated and was stupid w.r.t. Kolmogorov Complexity, and I think you have misread the statement too. The program "enumerate all X symbol strings from this Y letter alphabet then choose the Nth" is pretty much one of the simplest ways of encoding a string. So I was merely remarking that to single out one 80 symbol, 27 letter alphabet string, you need at least 381 bits, or you will have incomplete domain coverage due to the pigeon-hole principle.

If we expand the alphabet to 32 letters, then it obviously takes 400 bits, which is 50 bytes.