Ron M. Roth

Orcid: 0000-0003-4168-9505

Affiliations:
  • Technion - Israel Institute of Technology, Haifa, Israel


According to our database1, Ron M. Roth authored at least 110 papers between 1985 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Awards

IEEE Fellow

IEEE Fellow 2003, "For contributions to algebraic and modulation coding.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Error-Detection Schemes for Analog Content-Addressable Memories.
IEEE Trans. Computers, July, 2024

Multiple-Error-Correcting Codes for Analog Computing on Resistive Crossbars.
CoRR, 2024

On-Access Error Correction in Certain Types of Content-Addressable Memories.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Memristive Quaternary Content-Addressable Memories for Implementing Boolean Functions.
Proceedings of the IEEE International Symposium on Circuits and Systems, 2024

2023
Corrections to "Analog Error-Correcting Codes".
IEEE Trans. Inf. Theory, June, 2023

On the Implementation of Boolean Functions on Content-Addressable Memories.
IEEE J. Sel. Areas Inf. Theory, 2023

RACE-IT: A Reconfigurable Analog CAM-Crossbar Engine for In-Memory Transformer Acceleration.
CoRR, 2023

X-TIME: An in-memory engine for accelerating machine learning on tabular data with CAMs.
CoRR, 2023

2022
Higher-Order MDS Codes.
IEEE Trans. Inf. Theory, 2022

Asymptotic Bounds on the Rate of Locally Repairable Codes.
IEEE Trans. Inf. Theory, 2022

Fault-Tolerant Neuromorphic Computing on Nanoscale Crossbar Architectures.
Proceedings of the IEEE Information Theory Workshop, 2022

2021
Variable-Length Constrained Coding and Kraft Conditions: The Parity-Preserving Case.
IEEE Trans. Inf. Theory, 2021

On Bi-Modal Constrained Coding.
IEEE Trans. Inf. Theory, 2021

On the number of factorizations of polynomials over finite fields.
J. Comb. Theory A, 2021

2020
Analog Error-Correcting Codes.
IEEE Trans. Inf. Theory, 2020

On Parity-Preserving Variable-Length Constrained Coding.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
On Spectral Design Methods for Quasi-Cyclic Codes.
IEEE Trans. Inf. Theory, 2019

Fault-Tolerant Dot-Product Engines.
IEEE Trans. Inf. Theory, 2019

On the Pointwise Threshold Behavior of the Binary Erasure Polarization Subchannels.
IEEE Trans. Inf. Theory, 2019

The Capacity of Count-Constrained ICI-Free Systems.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Construction of Sidon Spaces With Applications to Coding.
IEEE Trans. Inf. Theory, 2018

On Decoding Rank-Metric Codes Over Large Fields.
IEEE Trans. Inf. Theory, 2018

On Parity-Preserving Constrained Coding.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
On the Capacity of Generalized Ising Channels.
IEEE Trans. Inf. Theory, 2017

Long Cyclic Codes Over GF(4) and GF(8) Better Than BCH Codes in the High-Rate Region.
IEEE Trans. Inf. Theory, 2017

2015
New Bounds and Constructions for Granular Media Coding.
IEEE Trans. Inf. Theory, 2015

Improved burst error correction via list decoding quasi-cyclic codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Bounds and Constructions for Granular Media Coding.
IEEE Trans. Inf. Theory, 2014

Coding for Combined Block-Symbol Error Correction.
IEEE Trans. Inf. Theory, 2014

Burst List Decoding of Interleaved Reed-Solomon Codes.
IEEE Trans. Inf. Theory, 2014

New upper bounds for grain-correcting and grain-detecting codes.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

When data must satisfy constraints upon writing.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Hamming-weight constrained coded arrays based on covering codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Improved bounds and constructions for granular media coding.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Low Complexity Two-Dimensional Weight-Constrained Codes.
IEEE Trans. Inf. Theory, 2012

Asymptotic Enumeration of Binary Matrices with Bounded Row and Column Sums.
SIAM J. Discret. Math., 2012

On q-ary antipodal matchings and applications.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Convex Programming Upper Bounds on the Capacity of 2-D Constraints.
IEEE Trans. Inf. Theory, 2011

Two-Dimensional Maximum-Likelihood Sequence Detection Is NP Hard.
IEEE Trans. Inf. Theory, 2011

Asymptotic enumeration of binary matrices with bounded row and column weights.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
PEDS: A Parallel Error Detection Scheme for TCAM Devices.
IEEE/ACM Trans. Netw., 2010

Bounds on the rate of 2-D bit-stuffing encoders.
IEEE Trans. Inf. Theory, 2010

Two-dimensional constrained coding based on tiling.
IEEE Trans. Inf. Theory, 2010

On linear balancing sets.
Adv. Math. Commun., 2010

Fixed-rate tiling encoders for 2-D constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
On row-by-row coding for 2-D constraints.
IEEE Trans. Inf. Theory, 2009

List decoding of burst errors.
IEEE Trans. Inf. Theory, 2009

Single-exclusion number and the stopping redundancy of MDS codes.
IEEE Trans. Inf. Theory, 2009

Concave programming upper bounds on the capacity of 2-D constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Approximate enumerative coding for 2-D constraints through ratios of maprix Products.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
On the Hardness of Decoding the Gale-Berlekamp Code.
IEEE Trans. Inf. Theory, 2008

Probabilistic algorithm for finding roots of linearized polynomials.
Des. Codes Cryptogr., 2008

2007
Bounds for Binary Codes With Narrow Distance Distributions.
IEEE Trans. Inf. Theory, 2007

Capacity Lower Bounds and Approximate Enumerative Coding for 2-D Constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Bounds on Single-Exclusion Numbers and Stopping Redundancy of MDS Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Improved Nearly-MDS Expander Codes.
IEEE Trans. Inf. Theory, 2006

Lowest Density MDS Codes Over Extension Alphabets.
IEEE Trans. Inf. Theory, 2006

Introduction to coding theory.
Cambridge University Press, ISBN: 978-0-521-84504-5, 2006

2005
Symbol-intersecting codes.
IEEE Trans. Inf. Theory, 2005

On the second moment of the distance distribution of binary codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Improved bit-stuffing bounds on two-dimensional constraints.
IEEE Trans. Inf. Theory, 2004

Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints.
SIAM J. Discret. Math., 2004

Cross-symbol codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On nearly-MDS expander codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Bounds on the List-Decoding Radius of Reed-Solomon Codes.
SIAM J. Discret. Math., 2003

Generalized minimum distance iterative decoding of expander codes.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2002
Parallel constrained coding with application to two-dimensional constraints.
IEEE Trans. Inf. Theory, 2002

2001
Lower bounds on the anticipation of encoders for input-constrained channels.
IEEE Trans. Inf. Theory, 2001

Efficient coding schemes for the hard-square model.
IEEE Trans. Inf. Theory, 2001

Nested block decodable runlength-limited codes.
IEEE Trans. Inf. Theory, 2001

2000
Efficient decoding of Reed-Solomon codes beyond half the minimum distance.
IEEE Trans. Inf. Theory, 2000

Two-dimensional weight-constrained codes through enumeration bounds.
IEEE Trans. Inf. Theory, 2000

Nested input-constrained codes.
IEEE Trans. Inf. Theory, 2000

Lossless sliding-block compression of constrained systems.
IEEE Trans. Inf. Theory, 2000

On runlength-limited coding with DC control.
IEEE Trans. Commun., 2000

1999
Efficient Code Construction for Certain Two-Dimensional Constraints.
IEEE Trans. Inf. Theory, 1999

Hierarchical Guessing with a Fidelity Criterion.
IEEE Trans. Inf. Theory, 1999

On Lowest Density MDS Codes.
IEEE Trans. Inf. Theory, 1999

1998
Efficient Encoding Algorithm for Third-Order Spectral-Null Codes.
IEEE Trans. Inf. Theory, 1998

Reduced-Redundancy Product Codes for Burst Error Correction.
IEEE Trans. Inf. Theory, 1998

Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference.
SIAM J. Comput., 1998

1997
Probabilistic crisscross error correction.
IEEE Trans. Inf. Theory, 1997

Is code equivalence easy to decide?
IEEE Trans. Inf. Theory, 1997

1996
Location-correcting codes.
IEEE Trans. Inf. Theory, 1996

Tensor codes for the rank metric.
IEEE Trans. Inf. Theory, 1996

On the decoding delay of encoders for input-constrained channels.
IEEE Trans. Inf. Theory, 1996

Spectral-Null Codes and Null Spaces of {Hadamard} Submatrices.
Des. Codes Cryptogr., 1996

1995
Construction of encoders with small decoding look-ahead for input-constrained channels.
IEEE Trans. Inf. Theory, 1995

Optimal File Sharing in Distributed Networks.
SIAM J. Comput., 1995

Constructions of Permutation Arrays for Certain Scheduling Cost Measures.
Random Struct. Algorithms, 1995

1994
High-order spectral-null codes - Construction and bounds.
IEEE Trans. Inf. Theory, 1994

Lee-metric BCH codes and their application to constrained and partial-response channels.
IEEE Trans. Inf. Theory, 1994

Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian Inference.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993
New array codes for multiple phased burst correction.
IEEE Trans. Inf. Theory, 1993

1992
Author's Reply to Comments on 'Maximum-rank array codes and their application to crisscross error correction'.
IEEE Trans. Inf. Theory, 1992

Improved Gilbert-Varshamov bound for constrained systems.
IEEE Trans. Inf. Theory, 1992

Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs.
IEEE Trans. Inf. Theory, 1992

t-sum generators of finite Abelian groups.
Discret. Math., 1992

1991
Maximum-rank array codes and their application to crisscross error correction.
IEEE Trans. Inf. Theory, 1991

Bounds on the number of states in encoder graphs for input-constrained channels.
IEEE Trans. Inf. Theory, 1991

Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2).
SIAM J. Comput., 1991

Optimal File Sharing in Distributed Networks (Preliminary Version)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
Application of circulant matrices to the construction and decoding of linear codes.
IEEE Trans. Inf. Theory, 1990

1989
On MDS codes via Cauchy matrices.
IEEE Trans. Inf. Theory, 1989

A construction of non-Reed-Solomon type MDS codes.
IEEE Trans. Inf. Theory, 1989

1988
Encoding and decoding of BCH codes using light and short codewords.
IEEE Trans. Inf. Theory, 1988

Composition of Reed-Solomon codes and geometric designs.
IEEE Trans. Inf. Theory, 1988

1986
On MDS extensions of generalized Reed-Solomon codes.
IEEE Trans. Inf. Theory, 1986

On cyclic MDS codes of length q over GF(q).
IEEE Trans. Inf. Theory, 1986

1985
On generator matrices of MDS codes.
IEEE Trans. Inf. Theory, 1985


  Loading...