Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality

arXiv:2510.07179v2 Announce Type: replace-cross Abstract: Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing e...

🔗 Read more: https://arxiv.org/abs/2510.07179

#News #Energy #Policy #Quantum #Tech #Software #Academic