![]() |
|
Engineering your own voynich - Printable Version +- The Voynich Ninja (https://www.voynich.ninja) +-- Forum: Voynich Research (https://www.voynich.ninja/forum-27.html) +--- Forum: Voynich Talk (https://www.voynich.ninja/forum-6.html) +--- Thread: Engineering your own voynich (/thread-3592.html) |
RE: Engineering your own voynich - nablator - 21-07-2021 Now looking for the longest repeated strings, there are quite a few for such a short text, so homophones for many tokens are unlikely. ooiea Tiaeean bar nmaei Teib T fiiinuy Timyun Taeaei ir Tian Fooyun Fiiiyun iaq meaei Tiavinn Ti TiiiT fiiinuy Ti aiiea Tiiiig Ki qeK niinuy ... Is that what deterministic means: only one cipher text is possible? This would exclude homophones and nulls. RE: Engineering your own voynich - Emma May Smith - 21-07-2021 RE: Engineering your own voynich - Emma May Smith - 21-07-2021 RE: Engineering your own voynich - Koen G - 21-07-2021 RE: Engineering your own voynich - Emma May Smith - 21-07-2021 RE: Engineering your own voynich - nablator - 21-07-2021 RE: Engineering your own voynich - Koen G - 21-07-2021 RE: Engineering your own voynich - Koen G - 21-07-2021 RE: Engineering your own voynich - Emma May Smith - 21-07-2021 RE: Engineering your own voynich - Koen G - 21-07-2021 |