The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ron M. Roth: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ron M. Roth
    Spectral-Null Codes and Null Spaces of Hadamard Submatrices. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1993, pp:141-153 [Conf]
  2. Moni Naor, Ron M. Roth
    Optimal File Sharing in Distributed Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:515-525 [Conf]
  3. Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth
    Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:344-354 [Conf]
  4. 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]
  5. 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]
  6. Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth
    Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:942-959 [Journal]
  7. Moni Naor, Ron M. Roth
    Optimal File Sharing in Distributed Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:1, pp:158-183 [Journal]
  8. Ron M. Roth, Gyora M. Benedek
    Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:2, pp:291-314 [Journal]
  9. 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]
  10. Gitit Ruckenstein, Ron M. Roth
    Bounds on the List-Decoding Radius of Reed--Solomon Codes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:17, n:2, pp:171-195 [Journal]
  11. Noga Alon, Jehoshua Bruck, Joseph Naor, Moni Naor, Ron M. Roth
    Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:2, pp:509-0 [Journal]
  12. Jonathan J. Ashley, Brian H. Marcus, Ron M. Roth
    Construction of encoders with small decoding look-ahead for input-constrained channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:1, pp:55-76 [Journal]
  13. Jonathan J. Ashley, Brian H. Marcus, Ron M. Roth
    On the decoding delay of encoders for input-constrained channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1948-1956 [Journal]
  14. Mario Blaum, Ron M. Roth
    New array codes for multiple phased burst correction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:1, pp:66-77 [Journal]
  15. Mario Blaum, Ron M. Roth
    On Lowest Density MDS Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:1, pp:46-59 [Journal]
  16. John L. Fan, Brian H. Marcus, Ron M. Roth
    Lossless sliding-block compression of constrained systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:2, pp:624-633 [Journal]
  17. Shirley Halevy, Jiangxin Chen, Ron M. Roth, Paul H. Siegel, Jack K. Wolf
    Improved bit-stuffing bounds on two-dimensional constraints. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:5, pp:824-838 [Journal]
  18. 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]
  19. Josh Hogan, Ron M. Roth, Gitit Ruckenstein
    Nested input-constrained codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1302-1316 [Journal]
  20. Josh Hogan, Ron M. Roth, Gitit Ruckenstein
    Nested block decodable runlength-limited codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:4, pp:1630-1638 [Journal]
  21. 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]
  22. Brian H. Marcus, Ron M. Roth
    Improved Gilbert-Varshamov bound for constrained systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:4, pp:1213-1221 [Journal]
  23. Neri Merhav, Ron M. Roth, Erdal Arikan
    Hierarchical Guessing with a Fidelity Criterion. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:1, pp:330-337 [Journal]
  24. 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]
  25. Erez Petrank, Ron M. Roth
    Is code equivalence easy to decide? [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:5, pp:1602-1604 [Journal]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. Ron M. Roth, Abraham Lempel
    Composition of Reed-Solomon codes and geometric designs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:4, pp:810-816 [Journal]
  31. Ron M. Roth, Abraham Lempel
    A construction of non-Reed-Solomon type MDS codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:3, pp:655-0 [Journal]
  32. Ron M. Roth, Abraham Lempel
    On MDS codes via Cauchy matrices. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:6, pp:1314-0 [Journal]
  33. 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]
  34. 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]
  35. Ron M. Roth, Gadiel Seroussi
    Symbol-intersecting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:7, pp:2266-2281 [Journal]
  36. Ron M. Roth, Gadiel Seroussi
    On generator matrices of MDS codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:6, pp:826-0 [Journal]
  37. Ron M. Roth, Gadiel Seroussi
    On cyclic MDS codes of length q over GF(q). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:2, pp:284-0 [Journal]
  38. Ron M. Roth, Gadiel Seroussi
    Encoding and decoding of BCH codes using light and short codewords. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:3, pp:593-0 [Journal]
  39. 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]
  40. Ron M. Roth, Gadiel Seroussi
    Location-correcting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:2, pp:554-565 [Journal]
  41. Ron M. Roth, Gadiel Seroussi
    Reduced-Redundancy Product Codes for Burst Error Correction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:4, pp:1395-1406 [Journal]
  42. Ron M. Roth, Paul H. Siegel, Alexander Vardy
    High-order spectral-null codes - Construction and bounds. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:6, pp:1826-1840 [Journal]
  43. Ron M. Roth, Paul H. Siegel, Jack K. Wolf
    Efficient coding schemes for the hard-square model. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:3, pp:1166-1176 [Journal]
  44. 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]
  45. Gadiel Seroussi, Ron M. Roth
    On MDS extensions of generalized Reed-Solomon codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:3, pp:349-354 [Journal]
  46. Vitaly Skachek, Tuvi Etzion, Ron M. Roth
    Efficient Encoding Algorithm for Third-Order Spectral-Null Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:2, pp:846-851 [Journal]
  47. Roman Talyansky, Tuvi Etzion, Ron M. Roth
    Efficient Code Construction for Certain Two-Dimensional Constraints. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:794-799 [Journal]
  48. Ron M. Roth, Vitaly Skachek
    Improved Nearly-MDS Expander Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:8, pp:3650-3661 [Journal]
  49. Ron M. Roth, Vitaly Skachek
    Improved Nearly-MDS Expander Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  50. Ron M. Roth, Abraham Lempel
    t-sum generators of finite Abelian groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:103, n:3, pp:279-292 [Journal]

  51. PEDS: A Parallel Error Detection Scheme for TCAM Devices. [Citation Graph (, )][DBLP]


  52. Single-Exclusion Number and the Stopping Redundancy of MDS Codes [Citation Graph (, )][DBLP]


  53. Concave Programming Upper Bounds on the Capacity of 2-D Constraints [Citation Graph (, )][DBLP]


  54. On row-by-row coding for 2-D constraints [Citation Graph (, )][DBLP]


  55. List Decoding of Burst Errors [Citation Graph (, )][DBLP]


  56. On linear balancing sets [Citation Graph (, )][DBLP]


  57. Bounds on the Rate of 2-D Bit-Stuffing Encoders [Citation Graph (, )][DBLP]


  58. Probabilistic algorithm for finding roots of linearized polynomials. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002