Problem #PRU-5002

Problems Cryptography Number theory

Problem

Find one way to encrypt letters of Latin alphabet as sequences of \(0\)s and \(1\)s, each letter corresponds to a sequence of five symbols.