Ron M. Roth Spectral-Null Codes and Null Spaces of {Hadamard} Submatrices. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1996, v:9, n:2, pp:177-191 [Journal]
Joseph Naor, Ron M. Roth Constructions of Permutation Arrays for Certain Scheduling Cost Measures. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1995, v:6, n:1, pp:39-50 [Journal]
Erik Ordentlich, Ron M. Roth Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2004, v:17, n:4, pp:615-623 [Journal]
Shirley Halevy, Ron M. Roth Parallel constrained coding with application to two-dimensional constraints. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:5, pp:1009-1020 [Journal]
Brian H. Marcus, Ron M. Roth Bounds on the number of states in encoder graphs for input-constrained channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:742-758 [Journal]
Erik Ordentlich, Ron M. Roth Two-dimensional weight-constrained codes through enumeration bounds. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1292-1301 [Journal]
Ron M. Roth Maximum-rank array codes and their application to crisscross error correction. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:2, pp:328-336 [Journal]
Ron M. Roth Author's Reply to Comments on 'Maximum-rank array codes and their application to crisscross error correction'. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:3, pp:1183-0 [Journal]
Ron M. Roth Tensor codes for the rank metric. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2146-2157 [Journal]
Ron M. Roth Probabilistic crisscross error correction. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1997, v:43, n:5, pp:1425-1438 [Journal]
Ron M. Roth, Abraham Lempel Application of circulant matrices to the construction and decoding of linear codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1990, v:36, n:5, pp:1157-0 [Journal]
Ron M. Roth, Gitit Ruckenstein Efficient decoding of Reed-Solomon codes beyond half the minimum distance. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:1, pp:246-257 [Journal]
Ron M. Roth, Paul H. Siegel Lee-metric BCH codes and their application to constrained and partial-response channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1994, v:40, n:4, pp:1083-1096 [Journal]
Gitit Ruckenstein, Ron M. Roth Lower bounds on the anticipation of encoders for input-constrained channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1796-1812 [Journal]