Yaron Shany Toward an Explicit Construction of Nonlinear Codes Exceeding the Tsfasman-Vladut-Zink Bound. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2004, v:50, n:11, pp:2844-2850 [Journal]
Yaron Shany, Yair Be'ery Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1514-1523 [Journal]
Yaron Shany, Yair Be'ery Bounds on the state complexity of codes from the Hermitian function field and its subfields. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1523-1527 [Journal]