Journal articles of Ronny Roth
Reed-Solomon codes and MDS codes
-
R.M. Roth, G. Seroussi,
On generator matrices of MDS codes,
IEEE Trans. Inform. Theory, IT-31 (1985), 826-830.
-
R.M. Roth, G. Seroussi,
On cyclic MDS codes of length q over GF(q),
IEEE Trans. Inform. Theory, IT-32 (1986), 284-285.
-
G. Seroussi, R.M. Roth,
On MDS extensions of generalized Reed-Solomon codes,
IEEE Trans. Inform. Theory, IT-32 (1986), 349-354.
-
R.M. Roth, A. Lempel,
Composition of Reed-Solomon codes and geometric designs,
IEEE Trans. Inform. Theory, 34 (1988), 810-816.
-
R.M. Roth, A. Lempel,
A construction of non-Reed-Solomon type MDS codes,
IEEE Trans. Inform. Theory, 35 (1989), 655-657.
-
R.M. Roth, A. Lempel,
On MDS codes via Cauchy matrices,
IEEE Trans. Inform. Theory, 35 (1989), 1314-1319.
-
M. Blaum, R.M. Roth,
On lowest density MDS codes,
IEEE Trans. Inform. Theory, 45 (1999), 46-59.
-
R.M. Roth, G. Ruckenstein,
Efficient decoding of Reed-Solomon codes beyond half
the minimum distance,
IEEE Trans. Inform. Theory, 46 (2000), 246-257.
-
G. Ruckenstein, R.M. Roth,
Bounds on the list-decoding radius of Reed-Solomon codes,
SIAM J. Discrete Math., 17 (2003), 171-195.
-
E. Louidor, R.M. Roth,
Lowest density MDS codes over extension alphabets,
IEEE Trans. Inform. Theory, 52 (2006), 3186-3197.
-
R.M. Roth, V. Skachek,
Improved nearly-MDS expander codes,
IEEE Trans. Inform. Theory, 52 (2006), 3650-3661.
-
J. Han, P.H. Siegel, R.M. Roth,
Single-exclusion number and the stopping redundancy of MDS codes,
IEEE Trans. Inform. Theory, 55 (2009), 4155-4166.
-
R.M. Roth, P.O. Vontobel,
List decoding of burst errors,
IEEE Trans. Inform. Theory, 55 (2009), 4179-4190.
Array codes
-
R.M. Roth,
Maximum-rank array codes and their application to crisscross
error correction,
IEEE Trans. Inform. Theory, 37 (1991), 328-336
(see correction in 38 (1992), 1183).
-
M. Blaum, R.M. Roth,
New array codes for multiple phased burst correction,
IEEE Trans. Inform. Theory, 39 (1993), 66-77.
-
R.M. Roth,
Tensor codes for the rank metric,
IEEE Trans. Inform. Theory, 42 (1996), 2146-2157.
-
R.M. Roth,
Probabilistic crisscross error correction,
IEEE Trans. Inform. Theory, 43 (1997), 1425-1438.
-
R.M. Roth, G. Seroussi,
Reduced-redundancy product codes for burst error correction,
IEEE Trans. Inform. Theory, 44 (1998), 1395-1406.
Applications of error-correcting codes
-
R.M. Roth, G.M. Benedek,
Interpolation and approximation of sparse multivariate
polynomials over GF(2),
SIAM J. Comput., 20 (1991), 291-314.
-
M. Naor, R.M. Roth,
Optimal file sharing in distributed networks,
SIAM J. Comput., 24 (1995), 158-183.
-
E. Petrank, R.M. Roth,
Is code equivalence easy to decide?
IEEE Trans. Inform. Theory, 43 (1997), 1602-1604.
-
P.J. Kuekes, W. Robinett, R.M. Roth, G. Seroussi,
G.S. Snider, R.S. Williams,
Resistor-logic demultiplexers for nanoelectronics
based on constant-weight codes,
Nanotechnology, 17 (2006), 1052-1061.
-
R.M. Roth, W. Robinett, P.J. Kuekes, R.S. Williams,
Defect-tolerant demultiplexer circuits based on threshold
logic and coding,
Nanotechnology,
20 No. 13 (1 April 2009) 135201.
-
A. Bremler-Barr, D. Hay, D. Hendler, R.M. Roth,
PEDS: A Parallel error detection scheme for TCAM devices,
IEEE/ACM Trans. Networking, 18 (2010), 1665-1675.
Other ECC results
-
R.M. Roth, G. Seroussi,
Encoding and decoding of BCH codes using light and short codewords,
IEEE Trans. Inform. Theory, 34 (1988), 593-596.
-
R.M. Roth, A. Lempel,
Application of circulant matrices to the construction and decoding of
linear codes,
IEEE Trans. Inform. Theory, 36 (1990), 1157-1163.
-
N. Alon, J. Bruck, J. Naor, M. Naor, R.M. Roth,
Construction of asymptotically good low-rate error-correcting
codes through pseudo-random graphs,
IEEE Trans. Inform. Theory, 38 (1992), 509-516.
-
R.M. Roth, G. Seroussi,
Location-correcting codes,
IEEE Trans. Inform. Theory, 42 (1996), 554-565.
-
R.M. Roth, G. Seroussi,
Symbol-intersecting codes,
IEEE Trans. Inform. Theory, 51 (2005), 2266-2281.
-
R.M. Roth, G. Seroussi,
Bounds for binary codes with narrow distance distributions,
IEEE Trans. Inform. Theory, 53 (2007), 2760-2768.
Constrained systems and modulation codes
-
B.H. Marcus, R.M. Roth,
Bounds on the number of states in encoder graphs for
input-constrained channels,
IEEE Trans. Inform. Theory, 37 (1991), 742-758.
-
B.H. Marcus, R.M. Roth,
Improved Gilbert-Varshamov bound for constrained systems,
IEEE Trans. Inform. Theory, 38 (1992), 1213-1221.
-
J.J. Ashley, B.H. Marcus, R.M. Roth,
Construction of encoders with small decoding look-ahead for
input-constrained channels,
IEEE Trans. Inform. Theory, 41 (1995), 55-76.
-
J.J. Ashley, B.H. Marcus, R.M. Roth,
On the decoding delay of encoders for input-constrained channels,
IEEE Trans. Inform. Theory, 42 (1996), 1948-1956.
-
J.L. Fan, B.H. Marcus, R.M. Roth,
Lossless sliding-block compression of constrained systems,
IEEE Trans. Inform. Theory, 46 (2000), 624-633.
-
J. Hogan, R.M. Roth, G. Ruckenstein,
Nested input-constrained codes,
IEEE Trans. Inform. Theory, 46 (2000), 1302-1316.
-
J. Hogan, R.M. Roth, G. Ruckenstein,
Nested block decodable runlength-limited codes,
IEEE Trans. Inform. Theory, 47 (2001), 1630-1638.
-
G. Ruckenstein, R.M. Roth,
Lower bounds on the anticipation of encoders for
input-constrained channels,
IEEE Trans. Inform. Theory, 47 (2001), 1796-1812.
Spectral-null codes
-
R.M. Roth, P.H. Siegel,
Lee-metric BCH codes and their application to constrained
and partial-response channels,
IEEE Trans. Inform. Theory, 40 (1994), 1083-1096.
-
R.M. Roth, P.H. Siegel, A. Vardy,
High-order spectral-null codes: Constructions and bounds,
IEEE Trans. Inform. Theory, 40 (1994), 1826-1840.
-
R.M. Roth,
Spectral-null codes and null spaces of Hadamard submatrices,
Designs, Codes, and Cryptography, 9 (1996), 177-191.
-
V. Skachek, T. Etzion, R.M. Roth,
Efficient encoding algorithm for third-order spectral-null codes,
IEEE Trans. Inform. Theory, 44 (1998), 846-851.
-
R.M. Roth,
On runlength-limited coding with DC control,
IEEE Trans. Communications, 48 (2000), 351-358.
-
A. Mazumdar, R.M. Roth, P.O. Vontobel,
On linear balancing sets,
Adv. Math. Commun., 4 (2010), 345-361.
Multi-dimensional constrained coding
-
R. Talyansky, T. Etzion, R.M. Roth,
Efficient code constructions for certain two-dimensional
constraints,
IEEE Trans. Inform. Theory, 45 (1999), 794-799.
-
E. Ordentlich, R.M. Roth,
Two-dimensional weight-constrained codes through improved
enumeration bounds,
IEEE Trans. Inform. Theory, 46 (2000), 1292-1301.
-
R.M. Roth, P.H. Siegel, J.K. Wolf,
Efficient coding schemes for the hard-square model,
IEEE Trans. Inform. Theory, 47 (2001), 1166-1176.
-
S. Halevy, R.M. Roth,
Parallel constrained coding with application to
two-dimensional constraints,
IEEE Trans. Inform. Theory, 48 (2002), 1009-1020.
-
S. Halevy, J. Chen, R.M. Roth, P.H. Siegel, J.K. Wolf,
Improved bit-stuffing bounds on two-dimensional constraints,
IEEE Trans. Inform. Theory, 50 (2004), 824--838.
-
E. Ordentlich, R.M. Roth,
Independent sets in regular hypergraphs and
multi-dimensional runlength-limited constraints,
SIAM J. Disc. Math., 17 (2004), 615-623.
-
I. Tal, T. Etzion, R.M. Roth,
On row-by-row coding for 2-D constraints,
IEEE Trans. Inform. Theory, 55 (2009), 3565-3576.
-
A. Sharov, R.M. Roth,
Two-dimensional constrained coding based on tiling,
IEEE Trans. Inform. Theory, 56 (2010), 1800-1807.
-
I. Tal, R.M. Roth,
Bounds on the rate of 2-D bit-stuffing encoders,
IEEE Trans. Inform. Theory, 56 (2010), 2561-2567.
-
I. Tal, R.M. Roth,
Convex programming upper bounds on the capacity of 2-D constraints,
IEEE Trans. Inform. Theory, 57 (2011), 381-391.
Other results
-
R.M. Roth, A. Lempel,
t-sum generators of finite Abelian groups,
Discrete Math., 103 (1992), 279-292.
-
J. Naor, R.M. Roth,
Constructions of permutation arrays for certain
scheduling cost measures,
Random Structures and Algorithms, 6 (1995), 39-50.
-
R. Bar-Yehuda, D. Geiger, J. Naor, R.M. Roth,
Approximation algorithms for the vertex feedback set problem with
applications to constraint satisfaction and Bayesian inference,
SIAM J. Comput., 27 (1998), 942-959.
-
N. Merhav, R.M. Roth, E. Arikan,
Hierarchical guessing with a fidelity criterion,
IEEE Trans. Inform. Theory, 45 (1999), 330-337.
-
V. Skachek, R.M. Roth,
Probabilistic algorithm for finding roots of linearized polynomials,
Designs, Codes, and Cryptography, 46 (2008), 17-23.
-
R.M. Roth, K. Viswanathan,
On the hardness of decoding the Gale-Berlekamp code,
IEEE Trans. Inform. Theory, 54 (2008), 1050-1060.
-
E. Ordentlich, R.M. Roth,
Two-dimensional maximum-likelihood sequence detection is NP hard,
IEEE Trans. Inform. Theory, 57 (2011), 7661-7670.
Back to Ronny Roth's home page