| |
| 2008 | ||
|---|---|---|
| 6 | EE | Beniamin Mounits: Lower bounds on the minimum average distance of binary codes. Discrete Mathematics 308(24): 6241-6253 (2008) |
| 2007 | ||
| 5 | EE | Beniamin Mounits: Lower bounds on the minimum average distance of binary codes CoRR abs/0706.3295: (2007) |
| 4 | EE | Simon Litsyn, Beniamin Mounits: Improved lower bounds on sizes of single-error correcting codes. Des. Codes Cryptography 42(1): 67-72 (2007) |
| 2005 | ||
| 3 | EE | Beniamin Mounits, Tuvi Etzion, Simon Litsyn: New Upper Bounds on A(n,d) CoRR abs/cs/0508107: (2005) |
| 2 | EE | Tuvi Etzion, Beniamin Mounits: Quasi-perfect codes with small distance. IEEE Transactions on Information Theory 51(11): 3938-3946 (2005) |
| 2002 | ||
| 1 | Beniamin Mounits, Tuvi Etzion, Simon Litsyn: Improved upper bounds on sizes of codes. IEEE Transactions on Information Theory 48(4): 880-886 (2002) | |
| 1 | Tuvi Etzion | [1] [2] [3] |
| 2 | Simon Litsyn | [1] [3] [4] |