Can we use coding-theory, heavy-tailed distributions, and optimal-transport to create ๐๐ฒ๐ฟ๐ผ-๐ฑ๐ถ๐๐๐ผ๐ฟ๐๐ถ๐ผ๐ป, ๐ฒ๐ฎ๐๐ ๐๐ผ ๐๐๐ฒ, ๐๐ฎ๐๐ฒ๐ฟ๐บ๐ฎ๐ฟ๐ธ๐ ๐ณ๐ผ๐ฟ ๐๐๐ ๐? We show they can โ and the result is pretty exciting! ๐ ๐งต (1/n)