Improved upper bounds on sizes of codes. - Beniamin Mounits; Tuvi Etzion; Simon Litsyn (IEEE Trans. Inf. Theory, 2002)

Quasiperfect codes with small distance. - Tuvi Etzion; Beniamin Mounits (ISIT, 2004)

New upper bounds on A(n, d). - Beniamin Mounits; Tuvi Etzion; Simon Litsyn (ISIT, 2005)

Quasi-perfect codes with small distance. - Tuvi Etzion; Beniamin Mounits (IEEE Trans. Inf. Theory, 2005)

New upper bounds on codes via association schemes and linear programming. - Beniamin Mounits; Tuvi Etzion; Simon Litsyn (Adv. Math. Commun., 2007)

Improved lower bounds on sizes of single-error correcting codes. - Simon Litsyn; Beniamin Mounits (Des. Codes Cryptogr., 2007)

Lower bounds on the minimum average distance of binary codes. - Beniamin Mounits (Discret. Math., 2008)