| |
| 2003 | ||
|---|---|---|
| 5 | EE | Gitit Ruckenstein, Ron M. Roth: Bounds on the List-Decoding Radius of Reed--Solomon Codes. SIAM J. Discrete Math. 17(2): 171-195 (2003) |
| 2001 | ||
| 4 | Josh Hogan, Ron M. Roth, Gitit Ruckenstein: Nested block decodable runlength-limited codes. IEEE Transactions on Information Theory 47(4): 1630-1638 (2001) | |
| 3 | Gitit Ruckenstein, Ron M. Roth: Lower bounds on the anticipation of encoders for input-constrained channels. IEEE Transactions on Information Theory 47(5): 1796-1812 (2001) | |
| 2000 | ||
| 2 | Ron M. Roth, Gitit Ruckenstein: Efficient decoding of Reed-Solomon codes beyond half the minimum distance. IEEE Transactions on Information Theory 46(1): 246-257 (2000) | |
| 1 | Josh Hogan, Ron M. Roth, Gitit Ruckenstein: Nested input-constrained codes. IEEE Transactions on Information Theory 46(4): 1302-1316 (2000) | |
| 1 | Josh Hogan | [1] [4] |
| 2 | Ron M. Roth | [1] [2] [3] [4] [5] |