Recent journal papers
- E. Ordentlich, R.M. Roth,,
On the pointwise threshold behavior of the binary erasure polarization subchannels,
IEEE Trans. Inf. Theory, 65 (2019), 6044–6055.
- R.M. Roth, A. Zeh,
On spectral design methods for quasi-cyclic codes,
IEEE Trans. Inf. Theory, 65 (2019), 2637–2647.
- R.M. Roth,
Fault-tolerant dot-product engines,
IEEE Trans. Inf. Theory, 65 (2019), 2046–2057.
- R.M. Roth, N. Raviv, I. Tamo,
Construction of Sidon spaces with applications to coding,
IEEE Trans. Inf. Theory, 64 (2018), 4412–4422.
- R.M. Roth,
On decoding rank-metric codes over large fields,
IEEE Trans. Inf. Theory, 64 (2018), 944–951.
- A. Sharov, R.M. Roth,
On the capacity of generalized Ising channels,
IEEE Trans. Inf. Theory, 63 (2017), 2338–2356.
- R.M. Roth, A. Zeh,
Long cyclic codes over GF(4) and GF(8) better than BCH codes in the high-rate region,
IEEE Trans. Inf. Theory, 63 (2017), 150–158.
- A. Sharov, R.M. Roth,
New bounds and constructions for granular media coding,
IEEE Trans. Inf. Theory, 61 (2015), 4227–4238.
- R.M. Roth, P.O. Vontobel,
Coding for combined block-symbol error correction,
IEEE Trans. Inf. Theory, 60 (2014), 2697–2713.
- A. Sharov, R.M. Roth,
Bounds and constructions for granular media coding,
IEEE Trans. Inf. Theory, 60 (2014), 2010–2027.
- T. Kolan, R.M. Roth,
Burst list decoding of interleaved Reed-Solomon codes,
IEEE Trans. Inf. Theory, 60 (2014), 182–189.
Conference abstracts (that have no journal version)
- R.M. Roth,,
Analog error-correcting codes,
Proc. IEEE Int’l Symp. on Information Theory, Paris, France (July 2019), 2419–2423.
- N. Kashyap, R.M. Roth, P.H. Siegel,
The capacity of count-constrained ICI-free systems,
Proc. IEEE Int’l Symp. on Information Theory, Paris, France (July 2019), 1592–1596.
- R.M. Roth, P.H. Siegel,
On parity-preserving constrained coding,
Proc. IEEE Int’l Symp. on Information Theory, Vail, Colorado (June 2018), 1804–1808.
- E. Ordentlich, R.M. Roth,
When data must satisfy constraints upon writing,
Proc. IEEE Int’l Symp. on Information Theory, Honolulu, Hawaii (June 2014), 2257–2261.
- E. Ordentlich, R.M. Roth,
Hamming-weight constrained coded arrays based on covering codes,
Proc. IEEE Int’l Symp. on Information Theory, Istanbul, Turkey (July 2013), 151–155.
- E. Ordentlich, R.M. Roth, G. Seroussi,
On q-ary antipodal matchings and applications,
Proc. IEEE Int’l Symp. on Information Theory, Cambridge, Massachusetts (July 2012), 111–115.
- A. Sharov, R.M. Roth,
Fixed-rate tiling encoders for 2-D constraints,
Proc. IEEE Int’l Symp. on Information Theory, Austin, Texas (June 2010), 1208–1212.
- E. Ordentlich, R.M. Roth,
Approximate enumerative coding for 2-D constraints through ratios of matrix products,
Proc. IEEE Int’l Symp. on Information Theory, Seoul, Korea (June 2009), 1050–1054.
- E. Ordentlich, R.M. Roth,
Capacity lower bounds and approximate enumerative coding for 2-D constraints,
Proc. IEEE Int’l Symp. on Information Theory, Nice, France (June 2007), 1681–1685.
- I. Tal, R.M. Roth,
On list decoding of alternant codes in the Hamming and Lee metrics,
IEEE Int’l Symp. on Information Theory, Yokohama, Japan (June 2003).
