default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRon M. Roth
Person information
- affiliation: Technion - Israel Institute of Technology, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j82]Ron M. Roth
:
Error-Detection Schemes for Analog Content-Addressable Memories. IEEE Trans. Computers 73(7): 1795-1808 (2024)- [c47]Luca Buonanno, Giacomo Pedretti, Lei Zhao, Aishwarya Natarajan, Todd Richmond, John Moon, Rand Jean, Xia Sheng, Ron M. Roth, Jim Ignowski:
Memristive Quaternary Content-Addressable Memories for Implementing Boolean Functions. ISCAS 2024: 1-5 - [c46]Ron M. Roth, Giacomo Pedretti:
On-Access Error Correction in Certain Types of Content-Addressable Memories. ISIT 2024: 1161-1166 - [i20]Hengjia Wei, Ron M. Roth:
Multiple-Error-Correcting Codes for Analog Computing on Resistive Crossbars. CoRR abs/2402.13503 (2024) - 2023
- [j81]Ron M. Roth:
On the Implementation of Boolean Functions on Content-Addressable Memories. IEEE J. Sel. Areas Inf. Theory 4: 379-392 (2023) - [j80]Ron M. Roth:
Corrections to "Analog Error-Correcting Codes". IEEE Trans. Inf. Theory 69(6): 3793-3794 (2023) - [c45]Ron M. Roth:
On the Implementation of Boolean Functions on Content-Addressable Memories. ISIT 2023: 1408-1413 - [i19]Giacomo Pedretti, John Moon, Pedro Bruel, Sergey Serebryakov, Ron M. Roth, Luca Buonanno, Tobias Ziegler, Cong Xu, Martin Foltin, Paolo Faraboschi, Jim Ignowski, Catherine E. Graves:
X-TIME: An in-memory engine for accelerating machine learning on tabular data with CAMs. CoRR abs/2304.01285 (2023) - [i18]Ron M. Roth:
On the Implementation of Boolean Functions on Content-Addressable Memories. CoRR abs/2305.13159 (2023) - [i17]Lei Zhao, Luca Buonanno, Ron M. Roth, Sergey Serebryakov, Archit Gajjar, John Moon, Jim Ignowski, Giacomo Pedretti:
RACE-IT: A Reconfigurable Analog CAM-Crossbar Engine for In-Memory Transformer Acceleration. CoRR abs/2312.06532 (2023) - 2022
- [j79]Ron M. Roth:
Asymptotic Bounds on the Rate of Locally Repairable Codes. IEEE Trans. Inf. Theory 68(3): 1581-1598 (2022) - [j78]Ron M. Roth:
Higher-Order MDS Codes. IEEE Trans. Inf. Theory 68(12): 7798-7816 (2022) - [c44]Ron M. Roth:
Higher-Order MDS Codes. ISIT 2022: 2166-2171 - [c43]Ron M. Roth:
Fault-Tolerant Neuromorphic Computing on Nanoscale Crossbar Architectures. ITW 2022: 202-207 - 2021
- [j77]Rachel N. Berman, Ron M. Roth:
On the number of factorizations of polynomials over finite fields. J. Comb. Theory A 182: 105462 (2021) - [j76]Ron M. Roth, Paul H. Siegel:
On Bi-Modal Constrained Coding. IEEE Trans. Inf. Theory 67(3): 1609-1621 (2021) - [j75]Ron M. Roth, Paul H. Siegel:
Variable-Length Constrained Coding and Kraft Conditions: The Parity-Preserving Case. IEEE Trans. Inf. Theory 67(9): 6179-6192 (2021) - [c42]Ron M. Roth:
Asymptotic Bounds on the Rate of Locally Repairable Codes. ISIT 2021: 3373-3378 - [i16]Ron M. Roth:
Higher-Order MDS Codes. CoRR abs/2111.03210 (2021) - 2020
- [j74]Ron M. Roth:
Analog Error-Correcting Codes. IEEE Trans. Inf. Theory 66(7): 4075-4088 (2020) - [c41]Rachel N. Berman, Ron M. Roth:
On the Number of Factorizations of Polynomials over Finite Fields. ISIT 2020: 1-6 - [c40]Ron M. Roth, Paul H. Siegel:
On Parity-Preserving Variable-Length Constrained Coding. ISIT 2020: 682-687 - [i15]Rachel N. Berman, Ron M. Roth:
On the Number of Factorizations of Polynomials over Finite Fields. CoRR abs/2004.03058 (2020) - [i14]Ron M. Roth, Paul H. Siegel:
On Parity-Preserving Variable-Length Constrained Coding. CoRR abs/2005.05455 (2020) - [i13]Ron M. Roth:
Asymptotic Bounds on the Rate of Locally Repairable Codes. CoRR abs/2010.14492 (2020)
2010 – 2019
- 2019
- [j73]Ron M. Roth:
Fault-Tolerant Dot-Product Engines. IEEE Trans. Inf. Theory 65(4): 2046-2057 (2019) - [j72]Ron M. Roth, Alexander Zeh:
On Spectral Design Methods for Quasi-Cyclic Codes. IEEE Trans. Inf. Theory 65(5): 2637-2647 (2019) - [j71]Erik Ordentlich, Ron M. Roth:
On the Pointwise Threshold Behavior of the Binary Erasure Polarization Subchannels. IEEE Trans. Inf. Theory 65(10): 6044-6055 (2019) - [c39]Navin Kashyap, Ron M. Roth, Paul H. Siegel:
The Capacity of Count-Constrained ICI-Free Systems. ISIT 2019: 1592-1596 - [c38]Ron M. Roth:
Analog Error-Correcting Codes. ISIT 2019: 2419-2423 - [i12]Navin Kashyap, Ron M. Roth, Paul H. Siegel:
The Capacity of Count-Constrained ICI-Free Systems. CoRR abs/1901.03261 (2019) - [i11]Ron M. Roth, Paul H. Siegel:
On Parity-Preserving Constrained Coding. CoRR abs/1912.12748 (2019) - 2018
- [j70]Ron M. Roth:
On Decoding Rank-Metric Codes Over Large Fields. IEEE Trans. Inf. Theory 64(2): 944-951 (2018) - [j69]Ron M. Roth, Netanel Raviv, Itzhak Tamo:
Construction of Sidon Spaces With Applications to Coding. IEEE Trans. Inf. Theory 64(6): 4412-4422 (2018) - [c37]Ron M. Roth, Paul H. Siegel:
On Parity-Preserving Constrained Coding. ISIT 2018: 1804-1808 - [c36]Ron M. Roth:
Fault- Tolerant Dot-Product Engines. ISIT 2018: 2197-2201 - 2017
- [j68]Ron M. Roth, Alexander Zeh:
Long Cyclic Codes Over GF(4) and GF(8) Better Than BCH Codes in the High-Rate Region. IEEE Trans. Inf. Theory 63(1): 150-158 (2017) - [j67]Artyom Sharov, Ron M. Roth:
On the Capacity of Generalized Ising Channels. IEEE Trans. Inf. Theory 63(4): 2338-2356 (2017) - [c35]Erik Ordentlich, Ron M. Roth:
On the pointwise threshold behavior of the binary erasure polarization subchannels. ISIT 2017: 859-863 - [c34]Ron M. Roth:
On decoding rank-metric codes over large fields. ISIT 2017: 2756-2760 - [i10]Ron M. Roth, Netanel Raviv, Itzhak Tamo:
Construction of Sidon spaces with applications to coding. CoRR abs/1705.04560 (2017) - [i9]Ron M. Roth:
Fault-Tolerant Dot-Product Engines. CoRR abs/1708.06892 (2017) - 2016
- [c33]Ron M. Roth, Alexander Zeh:
Long cyclic codes over GF(4) and GF(8) better than BCH codes in the high-rate region. ISIT 2016: 1103-1107 - [c32]Ron M. Roth, Alexander Zeh:
On spectral design methods for quasi-cyclic codes. ISIT 2016: 1108-1112 - 2015
- [j66]Artyom Sharov, Ron M. Roth:
New Bounds and Constructions for Granular Media Coding. IEEE Trans. Inf. Theory 61(8): 4227-4238 (2015) - [c31]Alexander Zeh, Ron M. Roth:
Improved burst error correction via list decoding quasi-cyclic codes. ISIT 2015: 16-20 - [c30]Artyom Sharov, Ron M. Roth:
On the capacity of generalized Ising channels. ISIT 2015: 2256-2260 - 2014
- [j65]Tom Kolan, Ron M. Roth:
Burst List Decoding of Interleaved Reed-Solomon Codes. IEEE Trans. Inf. Theory 60(1): 182-190 (2014) - [j64]Artyom Sharov, Ron M. Roth:
Bounds and Constructions for Granular Media Coding. IEEE Trans. Inf. Theory 60(4): 2010-2027 (2014) - [j63]Ron M. Roth, Pascal O. Vontobel:
Coding for Combined Block-Symbol Error Correction. IEEE Trans. Inf. Theory 60(5): 2697-2713 (2014) - [c29]Artyom Sharov, Ron M. Roth:
New upper bounds for grain-correcting and grain-detecting codes. ISIT 2014: 1121-1125 - [c28]Erik Ordentlich, Ron M. Roth:
When data must satisfy constraints upon writing. ISIT 2014: 2257-2261 - 2013
- [c27]Artyom Sharov, Ron M. Roth:
Improved bounds and constructions for granular media coding. Allerton 2013: 637-644 - [c26]Erik Ordentlich, Ron M. Roth:
Hamming-weight constrained coded arrays based on covering codes. ISIT 2013: 151-155 - [c25]Ron M. Roth, Pascal O. Vontobel:
Coding for combined block-symbol error correction. ISIT 2013: 1217-1221 - [i8]Ron M. Roth, Pascal O. Vontobel:
Coding for Combined Block-Symbol Error Correction. CoRR abs/1302.1931 (2013) - 2012
- [j62]Erik Ordentlich, Farzad Parvaresh, Ron M. Roth:
Asymptotic Enumeration of Binary Matrices with Bounded Row and Column Sums. SIAM J. Discret. Math. 26(4): 1550-1575 (2012) - [j61]Erik Ordentlich, Ron M. Roth:
Low Complexity Two-Dimensional Weight-Constrained Codes. IEEE Trans. Inf. Theory 58(6): 3892-3899 (2012) - [c24]Tom Kolan, Ron M. Roth:
Burst list decoding of interleaved Reed-Solomon codes. ISIT 2012: 81-85 - [c23]Erik Ordentlich, Ron M. Roth, Gadiel Seroussi:
On q-ary antipodal matchings and applications. ISIT 2012: 111-115 - 2011
- [j60]Ido Tal, Ron M. Roth:
Convex Programming Upper Bounds on the Capacity of 2-D Constraints. IEEE Trans. Inf. Theory 57(1): 381-391 (2011) - [j59]Erik Ordentlich, Ron M. Roth:
Two-Dimensional Maximum-Likelihood Sequence Detection Is NP Hard. IEEE Trans. Inf. Theory 57(12): 7661-7670 (2011) - [c22]Erik Ordentlich, Ron M. Roth:
Low complexity two-dimensional weight-constrained codes. ISIT 2011: 149-153 - [c21]Erik Ordentlich, Farzad Parvaresh, Ron M. Roth:
Asymptotic enumeration of binary matrices with bounded row and column weights. ISIT 2011: 154-158 - [c20]Artyom Sharov, Ron M. Roth:
Bounds and constructions for granular media coding. ISIT 2011: 2343-2347 - 2010
- [j58]Arya Mazumdar, Ron M. Roth, Pascal O. Vontobel:
On linear balancing sets. Adv. Math. Commun. 4(3): 345-361 (2010) - [j57]Artyom Sharov, Ron M. Roth:
Two-dimensional constrained coding based on tiling. IEEE Trans. Inf. Theory 56(4): 1800-1807 (2010) - [j56]Ido Tal, Ron M. Roth:
Bounds on the rate of 2-D bit-stuffing encoders. IEEE Trans. Inf. Theory 56(6): 2561-2567 (2010) - [j55]Anat Bremler-Barr, David Hay, Danny Hendler, Ron M. Roth:
PEDS: A Parallel Error Detection Scheme for TCAM Devices. IEEE/ACM Trans. Netw. 18(5): 1665-1675 (2010) - [c19]Artyom Sharov, Ron M. Roth:
Fixed-rate tiling encoders for 2-D constraints. ISIT 2010: 1208-1212
2000 – 2009
- 2009
- [j54]Ido Tal, Tuvi Etzion, Ron M. Roth:
On row-by-row coding for 2-D constraints. IEEE Trans. Inf. Theory 55(8): 3565-3576 (2009) - [j53]Junsheng Han, Paul H. Siegel, Ron M. Roth:
Single-exclusion number and the stopping redundancy of MDS codes. IEEE Trans. Inf. Theory 55(9): 4155-4166 (2009) - [j52]Ron M. Roth, Pascal O. Vontobel:
List decoding of burst errors. IEEE Trans. Inf. Theory 55(9): 4179-4190 (2009) - [c18]Anat Bremler-Barr, David Hay, Danny Hendler, Ron M. Roth:
PEDS: A Parallel Error Detection Scheme for TCAM Devices. INFOCOM 2009: 1296-1304 - [c17]Erik Ordentlich, Ron M. Roth:
Approximate enumerative coding for 2-D constraints through ratios of maprix Products. ISIT 2009: 1050-1054 - [c16]Ron M. Roth, Ido Tal:
Concave programming upper bounds on the capacity of 2-D constraints. ISIT 2009: 1060-1064 - [c15]Arya Mazumdar, Ron M. Roth, Pascal O. Vontobel:
On linear balancing sets. ISIT 2009: 2699-2703 - [i7]Arya Mazumdar, Ron M. Roth, Pascal O. Vontobel:
On linear balancing sets. CoRR abs/0901.3170 (2009) - [i6]Ido Tal, Ron M. Roth:
Bounds on the Rate of 2-D Bit-Stuffing Encoders. CoRR abs/0906.2372 (2009) - 2008
- [j51]Vitaly Skachek, Ron M. Roth:
Probabilistic algorithm for finding roots of linearized polynomials. Des. Codes Cryptogr. 46(1): 17-23 (2008) - [j50]Ron M. Roth, Krishnamurthy Viswanathan:
On the Hardness of Decoding the Gale-Berlekamp Code. IEEE Trans. Inf. Theory 54(3): 1050-1060 (2008) - [c14]Ron M. Roth, Pascal O. Vontobel:
List decoding of burst errors. ISIT 2008: 66-70 - [c13]Ido Tal, Ron M. Roth:
Bounds on the rate of 2-D bit-stuffing encoders. ISIT 2008: 1463-1467 - [c12]Artyom Sharov, Ron M. Roth:
Two-dimensional constrained coding based on tiling. ISIT 2008: 1468-1472 - [i5]Ido Tal, Ron M. Roth:
Concave Programming Upper Bounds on the Capacity of 2-D Constraints. CoRR abs/0801.1126 (2008) - [i4]Ido Tal, Tuvi Etzion, Ron M. Roth:
On row-by-row coding for 2-D constraints. CoRR abs/0808.0596 (2008) - [i3]Ron M. Roth, Pascal O. Vontobel:
List Decoding of Burst Errors. CoRR abs/0808.2837 (2008) - 2007
- [j49]Ron M. Roth, Gadiel Seroussi:
Bounds for Binary Codes With Narrow Distance Distributions. IEEE Trans. Inf. Theory 53(8): 2760-2768 (2007) - [c11]Ron M. Roth, Krishnamurthy Viswanathan:
On the Hardness of Decoding the Gale-Berlekamp Code. ISIT 2007: 1356-1360 - [c10]Erik Ordentlich, Ron M. Roth:
Capacity Lower Bounds and Approximate Enumerative Coding for 2-D Constraints. ISIT 2007: 1681-1685 - [c9]Junsheng Han, Paul H. Siegel, Ron M. Roth:
Bounds on Single-Exclusion Numbers and Stopping Redundancy of MDS Codes. ISIT 2007: 2941-2945 - [i2]Junsheng Han, Paul H. Siegel, Ron M. Roth:
Single-Exclusion Number and the Stopping Redundancy of MDS Codes. CoRR abs/0712.2857 (2007) - 2006
- [b1]Ron M. Roth:
Introduction to coding theory. Cambridge University Press 2006, ISBN 978-0-521-84504-5, pp. I-XI, 1-566 - [j48]Erez Louidor, Ron M. Roth:
Lowest Density MDS Codes Over Extension Alphabets. IEEE Trans. Inf. Theory 52(7): 3186-3197 (2006) - [j47]Ron M. Roth, Vitaly Skachek:
Improved Nearly-MDS Expander Codes. IEEE Trans. Inf. Theory 52(8): 3650-3661 (2006) - [c8]Ido Tal, Tuvi Etzion, Ron M. Roth:
On Row-by-Row Coding for 2-D Constraints. ISIT 2006: 1204-1208 - [i1]Ron M. Roth, Vitaly Skachek:
Improved Nearly-MDS Expander Codes. CoRR abs/cs/0601090 (2006) - 2005
- [j46]Ron M. Roth, Gadiel Seroussi:
Symbol-intersecting codes. IEEE Trans. Inf. Theory 51(7): 2266-2281 (2005) - [c7]Ron M. Roth, Gadiel Seroussi:
On the second moment of the distance distribution of binary codes. ISIT 2005: 931-935 - 2004
- [j45]Erik Ordentlich, Ron M. Roth:
Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints. SIAM J. Discret. Math. 17(4): 615-623 (2004) - [j44]Shirley Halevy, Jiangxin Chen, Ron M. Roth, Paul H. Siegel, Jack K. Wolf:
Improved bit-stuffing bounds on two-dimensional constraints. IEEE Trans. Inf. Theory 50(5): 824-838 (2004) - [c6]Ron M. Roth, Vitaly Skachek:
On nearly-MDS expander codes. ISIT 2004: 8 - [c5]Ron M. Roth, Gadiel Seroussi:
Cross-symbol codes. ISIT 2004: 396 - 2003
- [j43]Gitit Ruckenstein, Ron M. Roth:
Bounds on the List-Decoding Radius of Reed-Solomon Codes. SIAM J. Discret. Math. 17(2): 171-195 (2003) - [c4]Vitaly Skachek, Ron M. Roth:
Generalized minimum distance iterative decoding of expander codes. ITW 2003: 245-248 - 2002
- [j42]Shirley Halevy, Ron M. Roth:
Parallel constrained coding with application to two-dimensional constraints. IEEE Trans. Inf. Theory 48(5): 1009-1020 (2002) - 2001
- [j41]Ron M. Roth, Paul H. Siegel, Jack K. Wolf:
Efficient coding schemes for the hard-square model. IEEE Trans. Inf. Theory 47(3): 1166-1176 (2001) - [j40]Josh Hogan, Ron M. Roth, Gitit Ruckenstein:
Nested block decodable runlength-limited codes. IEEE Trans. Inf. Theory 47(4): 1630-1638 (2001) - [j39]Gitit Ruckenstein, Ron M. Roth:
Lower bounds on the anticipation of encoders for input-constrained channels. IEEE Trans. Inf. Theory 47(5): 1796-1812 (2001) - 2000
- [j38]Ron M. Roth:
On runlength-limited coding with DC control. IEEE Trans. Commun. 48(3): 351-358 (2000) - [j37]Ron M. Roth, Gitit Ruckenstein:
Efficient decoding of Reed-Solomon codes beyond half the minimum distance. IEEE Trans. Inf. Theory 46(1): 246-257 (2000) - [j36]John L. Fan, Brian H. Marcus, Ron M. Roth:
Lossless sliding-block compression of constrained systems. IEEE Trans. Inf. Theory 46(2): 624-633 (2000) - [j35]Erik Ordentlich, Ron M. Roth:
Two-dimensional weight-constrained codes through enumeration bounds. IEEE Trans. Inf. Theory 46(4): 1292-1301 (2000) - [j34]Josh Hogan, Ron M. Roth, Gitit Ruckenstein:
Nested input-constrained codes. IEEE Trans. Inf. Theory 46(4): 1302-1316 (2000)
1990 – 1999
- 1999
- [j33]Mario Blaum, Ron M. Roth:
On Lowest Density MDS Codes. IEEE Trans. Inf. Theory 45(1): 46-59 (1999) - [j32]Neri Merhav, Ron M. Roth, Erdal Arikan:
Hierarchical Guessing with a Fidelity Criterion. IEEE Trans. Inf. Theory 45(1): 330-337 (1999) - [j31]Roman Talyansky, Tuvi Etzion, Ron M. Roth:
Efficient Code Construction for Certain Two-Dimensional Constraints. IEEE Trans. Inf. Theory 45(2): 794-799 (1999) - 1998
- [j30]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) - [j29]Vitaly Skachek, Tuvi Etzion, Ron M. Roth:
Efficient Encoding Algorithm for Third-Order Spectral-Null Codes. IEEE Trans. Inf. Theory 44(2): 846-851 (1998) - [j28]Ron M. Roth, Gadiel Seroussi:
Reduced-Redundancy Product Codes for Burst Error Correction. IEEE Trans. Inf. Theory 44(4): 1395-1406 (1998) - 1997
- [j27]Ron M. Roth:
Probabilistic crisscross error correction. IEEE Trans. Inf. Theory 43(5): 1425-1438 (1997) - [j26]Erez Petrank, Ron M. Roth:
Is code equivalence easy to decide? IEEE Trans. Inf. Theory 43(5): 1602-1604 (1997) - 1996
- [j25]Ron M. Roth:
Spectral-Null Codes and Null Spaces of {Hadamard} Submatrices. Des. Codes Cryptogr. 9(2): 177-191 (1996) - [j24]Ron M. Roth, Gadiel Seroussi:
Location-correcting codes. IEEE Trans. Inf. Theory 42(2): 554-565 (1996) - [j23]