| 2009 |
|---|
| 59 | EE | Arya Mazumdar,
Ron M. Roth,
Pascal O. Vontobel:
On linear balancing sets
CoRR abs/0901.3170: (2009) |
| 2008 |
|---|
| 58 | EE | Ido Tal,
Ron M. Roth:
Concave Programming Upper Bounds on the Capacity of 2-D Constraints
CoRR abs/0801.1126: (2008) |
| 57 | EE | Ido Tal,
Tuvi Etzion,
Ron M. Roth:
On row-by-row coding for 2-D constraints
CoRR abs/0808.0596: (2008) |
| 56 | EE | Ron M. Roth,
Pascal O. Vontobel:
List Decoding of Burst Errors
CoRR abs/0808.2837: (2008) |
| 55 | EE | Vitaly Skachek,
Ron M. Roth:
Probabilistic algorithm for finding roots of linearized polynomials.
Des. Codes Cryptography 46(1): 17-23 (2008) |
| 54 | EE | Ron M. Roth,
Krishnamurthy Viswanathan:
On the Hardness of Decoding the Gale-Berlekamp Code.
IEEE Transactions on Information Theory 54(3): 1050-1060 (2008) |
| 2007 |
|---|
| 53 | EE | Junsheng Han,
Paul H. Siegel,
Ron M. Roth:
Single-Exclusion Number and the Stopping Redundancy of MDS Codes
CoRR abs/0712.2857: (2007) |
| 52 | EE | Ron M. Roth,
Gadiel Seroussi:
Bounds for Binary Codes With Narrow Distance Distributions.
IEEE Transactions on Information Theory 53(8): 2760-2768 (2007) |
| 2006 |
|---|
| 51 | EE | Ron M. Roth,
Vitaly Skachek:
Improved Nearly-MDS Expander Codes
CoRR abs/cs/0601090: (2006) |
| 50 | EE | Erez Louidor,
Ron M. Roth:
Lowest Density MDS Codes Over Extension Alphabets.
IEEE Transactions on Information Theory 52(7): 3186-3197 (2006) |
| 49 | EE | Ron M. Roth,
Vitaly Skachek:
Improved Nearly-MDS Expander Codes.
IEEE Transactions on Information Theory 52(8): 3650-3661 (2006) |
| 2005 |
|---|
| 48 | EE | Ron M. Roth,
Gadiel Seroussi:
Symbol-intersecting codes.
IEEE Transactions on Information Theory 51(7): 2266-2281 (2005) |
| 2004 |
|---|
| 47 | | Shirley Halevy,
Jiangxin Chen,
Ron M. Roth,
Paul H. Siegel,
Jack K. Wolf:
Improved bit-stuffing bounds on two-dimensional constraints.
IEEE Transactions on Information Theory 50(5): 824-838 (2004) |
| 46 | EE | Erik Ordentlich,
Ron M. Roth:
Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints.
SIAM J. Discrete Math. 17(4): 615-623 (2004) |
| 2003 |
|---|
| 45 | 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) |
| 2002 |
|---|
| 44 | | Shirley Halevy,
Ron M. Roth:
Parallel constrained coding with application to two-dimensional constraints.
IEEE Transactions on Information Theory 48(5): 1009-1020 (2002) |
| 2001 |
|---|
| 43 | | Ron M. Roth,
Paul H. Siegel,
Jack K. Wolf:
Efficient coding schemes for the hard-square model.
IEEE Transactions on Information Theory 47(3): 1166-1176 (2001) |
| 42 | | Josh Hogan,
Ron M. Roth,
Gitit Ruckenstein:
Nested block decodable runlength-limited codes.
IEEE Transactions on Information Theory 47(4): 1630-1638 (2001) |
| 41 | | 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 |
|---|
| 40 | | 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) |
| 39 | | John L. Fan,
Brian H. Marcus,
Ron M. Roth:
Lossless sliding-block compression of constrained systems.
IEEE Transactions on Information Theory 46(2): 624-633 (2000) |
| 38 | | Erik Ordentlich,
Ron M. Roth:
Two-dimensional weight-constrained codes through enumeration bounds.
IEEE Transactions on Information Theory 46(4): 1292-1301 (2000) |
| 37 | | Josh Hogan,
Ron M. Roth,
Gitit Ruckenstein:
Nested input-constrained codes.
IEEE Transactions on Information Theory 46(4): 1302-1316 (2000) |
| 1999 |
|---|
| 36 | | Neri Merhav,
Ron M. Roth,
Erdal Arikan:
Hierarchical Guessing with a Fidelity Criterion.
IEEE Transactions on Information Theory 45(1): 330-337 (1999) |
| 35 | | Mario Blaum,
Ron M. Roth:
On Lowest Density MDS Codes.
IEEE Transactions on Information Theory 45(1): 46-59 (1999) |
| 34 | | Roman Talyansky,
Tuvi Etzion,
Ron M. Roth:
Efficient Code Construction for Certain Two-Dimensional Constraints.
IEEE Transactions on Information Theory 45(2): 794-799 (1999) |
| 1998 |
|---|
| 33 | | Vitaly Skachek,
Tuvi Etzion,
Ron M. Roth:
Efficient Encoding Algorithm for Third-Order Spectral-Null Codes.
IEEE Transactions on Information Theory 44(2): 846-851 (1998) |
| 32 | | Ron M. Roth,
Gadiel Seroussi:
Reduced-Redundancy Product Codes for Burst Error Correction.
IEEE Transactions on Information Theory 44(4): 1395-1406 (1998) |
| 31 | EE | 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.
SIAM J. Comput. 27(4): 942-959 (1998) |
| 1997 |
|---|
| 30 | | Ron M. Roth:
Probabilistic crisscross error correction.
IEEE Transactions on Information Theory 43(5): 1425-1438 (1997) |
| 29 | | Erez Petrank,
Ron M. Roth:
Is code equivalence easy to decide?
IEEE Transactions on Information Theory 43(5): 1602-1604 (1997) |
| 1996 |
|---|
| 28 | | Ron M. Roth:
Spectral-Null Codes and Null Spaces of {Hadamard} Submatrices.
Des. Codes Cryptography 9(2): 177-191 (1996) |
| 27 | | Ron M. Roth,
Gadiel Seroussi:
Location-correcting codes.
IEEE Transactions on Information Theory 42(2): 554-565 (1996) |
| 26 | | Jonathan J. Ashley,
Brian H. Marcus,
Ron M. Roth:
On the decoding delay of encoders for input-constrained channels.
IEEE Transactions on Information Theory 42(6): 1948-1956 (1996) |
| 25 | | Ron M. Roth:
Tensor codes for the rank metric.
IEEE Transactions on Information Theory 42(6): 2146-2157 (1996) |
| 1995 |
|---|
| 24 | | Jonathan J. Ashley,
Brian H. Marcus,
Ron M. Roth:
Construction of encoders with small decoding look-ahead for input-constrained channels.
IEEE Transactions on Information Theory 41(1): 55-76 (1995) |
| 23 | | Joseph Naor,
Ron M. Roth:
Constructions of Permutation Arrays for Certain Scheduling Cost Measures.
Random Struct. Algorithms 6(1): 39-50 (1995) |
| 22 | | Moni Naor,
Ron M. Roth:
Optimal File Sharing in Distributed Networks.
SIAM J. Comput. 24(1): 158-183 (1995) |
| 1994 |
|---|
| 21 | | 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.
SODA 1994: 344-354 |
| 20 | | Ron M. Roth,
Paul H. Siegel:
Lee-metric BCH codes and their application to constrained and partial-response channels.
IEEE Transactions on Information Theory 40(4): 1083-1096 (1994) |
| 19 | | Ron M. Roth,
Paul H. Siegel,
Alexander Vardy:
High-order spectral-null codes - Construction and bounds.
IEEE Transactions on Information Theory 40(6): 1826-1840 (1994) |
| 1993 |
|---|
| 18 | | Ron M. Roth:
Spectral-Null Codes and Null Spaces of Hadamard Submatrices.
Algebraic Coding 1993: 141-153 |
| 17 | | Mario Blaum,
Ron M. Roth:
New array codes for multiple phased burst correction.
IEEE Transactions on Information Theory 39(1): 66-77 (1993) |
| 1992 |
|---|
| 16 | EE | Ron M. Roth,
Abraham Lempel:
t-sum generators of finite Abelian groups.
Discrete Mathematics 103(3): 279-292 (1992) |
| 15 | | Noga Alon,
Jehoshua Bruck,
Joseph Naor,
Moni Naor,
Ron M. Roth:
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs.
IEEE Transactions on Information Theory 38(2): 509- (1992) |
| 14 | | Ron M. Roth:
Author's Reply to Comments on 'Maximum-rank array codes and their application to crisscross error correction'.
IEEE Transactions on Information Theory 38(3): 1183- (1992) |
| 13 | | Brian H. Marcus,
Ron M. Roth:
Improved Gilbert-Varshamov bound for constrained systems.
IEEE Transactions on Information Theory 38(4): 1213-1221 (1992) |
| 1991 |
|---|
| 12 | | Moni Naor,
Ron M. Roth:
Optimal File Sharing in Distributed Networks (Preliminary Version)
FOCS 1991: 515-525 |
| 11 | | Ron M. Roth:
Maximum-rank array codes and their application to crisscross error correction.
IEEE Transactions on Information Theory 37(2): 328-336 (1991) |
| 10 | | Brian H. Marcus,
Ron M. Roth:
Bounds on the number of states in encoder graphs for input-constrained channels.
IEEE Transactions on Information Theory 37(3): 742-758 (1991) |
| 9 | | Ron M. Roth,
Gyora M. Benedek:
Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2).
SIAM J. Comput. 20(2): 291-314 (1991) |
| 1990 |
|---|
| 8 | | Ron M. Roth,
Abraham Lempel:
Application of circulant matrices to the construction and decoding of linear codes.
IEEE Transactions on Information Theory 36(5): 1157- (1990) |
| 1989 |
|---|
| 7 | | Ron M. Roth,
Abraham Lempel:
A construction of non-Reed-Solomon type MDS codes.
IEEE Transactions on Information Theory 35(3): 655- (1989) |
| 6 | | Ron M. Roth,
Abraham Lempel:
On MDS codes via Cauchy matrices.
IEEE Transactions on Information Theory 35(6): 1314- (1989) |
| 1988 |
|---|
| 5 | | Ron M. Roth,
Gadiel Seroussi:
Encoding and decoding of BCH codes using light and short codewords.
IEEE Transactions on Information Theory 34(3): 593- (1988) |
| 4 | | Ron M. Roth,
Abraham Lempel:
Composition of Reed-Solomon codes and geometric designs.
IEEE Transactions on Information Theory 34(4): 810-816 (1988) |
| 1986 |
|---|
| 3 | | Ron M. Roth,
Gadiel Seroussi:
On cyclic MDS codes of length q over GF(q).
IEEE Transactions on Information Theory 32(2): 284- (1986) |
| 2 | | Gadiel Seroussi,
Ron M. Roth:
On MDS extensions of generalized Reed-Solomon codes.
IEEE Transactions on Information Theory 32(3): 349-354 (1986) |
| 1985 |
|---|
| 1 | | Ron M. Roth,
Gadiel Seroussi:
On generator matrices of MDS codes.
IEEE Transactions on Information Theory 31(6): 826- (1985) |
