Semidefinite and linear programming bounds for sum-rank-metric codes and non-existence results
Finding the limits of codes that protect data sent across networks
Researchers developed new mathematical tools to determine the maximum size of error-correcting codes designed for modern communication systems like distributed storage and network coding. Using optimization techniques including semidefinite programming, they found sharper upper limits on code size than previous methods and proved that certain theoretically perfect codes cannot actually exist.
Error-correcting codes are fundamental to reliable data transmission—from cloud storage to wireless communications. These tighter bounds help engineers understand what's theoretically possible and avoid wasting resources searching for codes that don't exist, while the new optimization methods could improve the design of more efficient communication systems.