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

Adithya Sriram, Vedika Khemani, Benedikt Placke

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 ``…