Non-random coding error exponent for lattices. - Yuval Domb; Meir Feder (ISIT, 2012)

A Distance Spectrum Based, Upper Error Bound for Lattices - Yuval Domb; Meir Feder (CoRR, 2012)

Non-Random Coding Error Bounds for Lattices. - Yuval Domb; Meir Feder (IEEE Trans. Inf. Theory, 2016)

The Random Coding Bound Is Tight for the Average Linear Code or Lattice. - Yuval Domb; Ram Zamir; Meir Feder (IEEE Trans. Inf. Theory, 2016)

The Sum-Check Protocol over Fields of Small Characteristic. - Suyash Bagad; Yuval Domb; Justin Thaler (IACR Cryptol. ePrint Arch., 2024)

Really Complex Codes with Application to STARKs. - Yuval Domb (IACR Cryptol. ePrint Arch., 2024)

Speeding Up Sum-Check Proving. - Suyash Bagad; Quang Dao; Yuval Domb; Justin Thaler (IACR Cryptol. ePrint Arch., 2025)