Beniamin Mounits

According to our database, Beniamin Mounits authored at least 7 papers between 2002 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2008

Lower bounds on the minimum average distance of binary codes.

Beniamin Mounits

Discret. Math., 2008

2007

Improved lower bounds on sizes of single-error correcting codes.

Simon Litsyn, Beniamin Mounits

Des. Codes Cryptogr., 2007

New upper bounds on codes via association schemes and linear programming.

Beniamin Mounits, Tuvi Etzion, Simon Litsyn

Adv. Math. Commun., 2007

2005

Quasi-perfect codes with small distance.

Tuvi Etzion, Beniamin Mounits

IEEE Trans. Inf. Theory, 2005

New upper bounds on A(n, d).

Beniamin Mounits, Tuvi Etzion, Simon Litsyn

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

Quasiperfect codes with small distance.

Tuvi Etzion, Beniamin Mounits

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2002

Improved upper bounds on sizes of codes.

Beniamin Mounits, Tuvi Etzion, Simon Litsyn

IEEE Trans. Inf. Theory, 2002