27-08-2019, 07:57 PM
Right, I think I understand. So to to read this you would need to understand the operation that took place and convert this operation (rather than the resulting letters) into your source text. An advantage of this is that on the one hand you rely on the preceding, but on the other hand if you make one mistake it doesn't ripple through your entire code.
Complex codes are not my area of expertise, but it does feel doable if there are not too many steps per letter involved. Remember that the VM is over 200k characters. I think it would become too time consuming quickly once you add extra steps above simple substitution (i.e. transcription).
Another question I have is what effect such a code would have on typ-token ratio. Wouldn't you get an abnormal amount of unique words? If "bed" results in "azexiz", what are your odds of ever getting "azexiz" again? (I really don't know, I guess you'd have to test this).
Complex codes are not my area of expertise, but it does feel doable if there are not too many steps per letter involved. Remember that the VM is over 200k characters. I think it would become too time consuming quickly once you add extra steps above simple substitution (i.e. transcription).
Another question I have is what effect such a code would have on typ-token ratio. Wouldn't you get an abnormal amount of unique words? If "bed" results in "azexiz", what are your odds of ever getting "azexiz" again? (I really don't know, I guess you'd have to test this).
![[+]](https://www.voynich.ninja/images/collapse_collapsed.png)
