| 2004 |
|---|
| 7 | | Yaron Shany,
Ilan Reuven,
Yair Be'ery:
Lower bounds on the state complexity of linear tail-biting trellises.
IEEE Transactions on Information Theory 20(3): 566-571 (2004) |
| 6 | | Yaron Shany:
Toward an Explicit Construction of Nonlinear Codes Exceeding the Tsfasman-Vladut-Zink Bound.
IEEE Transactions on Information Theory 50(11): 2844-2850 (2004) |
| 5 | | Yaron Shany,
Yair Be'ery:
A note on nonlinear Xing codes.
IEEE Transactions on Information Theory 50(4): 699-700 (2004) |
| 2000 |
|---|
| 4 | | Yaron Shany,
Yair Be'ery:
Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes.
IEEE Transactions on Information Theory 46(4): 1514-1523 (2000) |
| 3 | | Yaron Shany,
Yair Be'ery:
Bounds on the state complexity of codes from the Hermitian function field and its subfields.
IEEE Transactions on Information Theory 46(4): 1523-1527 (2000) |
| 1999 |
|---|
| 2 | | Yaron Shany,
Yair Be'ery:
The Preparata and Goethals codes: Trellis complexity and twisted squaring constructions.
IEEE Transactions on Information Theory 45(5): 1667-1673 (1999) |
| 1998 |
|---|
| 1 | | Yaron Shany,
Ilan Reuven,
Yair Be'ery:
On the Trellis Representation of the Delsarte-Goethals Codes.
IEEE Transactions on Information Theory 44(4): 1547-1554 (1998) |
