Complete bipartite embeddings, lattice non-embeddability, and non-Euclidean powers of information distance

We encode the vertices of every finite complete bipartite graph as binary strings at each scale. The information distances between these strings approximate the scaled graph distances with an additive error bounded by a constant independent of the scale. We also assign one fixed infinite binary sequ