Discrepancy for Random Linear Codes
This work establishes discrepancy theorems for random linear codes, proving they behave nearly optimally for list-decoding and zero-error list-recovery above capacity. These results show that random linear codes match unstructured random codes in these settings, which is then used to prove the existence of highly resilient n-party linear ramp secret sharing schemes.