Search Results - "Roth, Ron M."

Higher-Order MDS Codes by Roth, Ron M.

“…An improved Singleton-type upper bound is presented for the list decoding radius of linear codes, in terms of the code parameters <inline-formula> <tex-math…”
Get full text

Corrections to “Analog Error-Correcting Codes” by Roth, Ron M.

“…In the above article [1] , Lemma 2 contained an error, which also affects the proof of Theorem 1 therein. Specifically, Theorem 1 holds only when [Formula…”
Get full text

Error-Detection Schemes for Analog Content-Addressable Memories by Roth, Ron M.

“…Analog content-addressable memories (in short, a-CAMs) have been recently introduced as accelerators for machine-learning tasks, such as tree-based inference…”
Get full text

Asymptotic Bounds on the Rate of Locally Repairable Codes by Roth, Ron M.

“…New asymptotic upper bounds are presented on the rate of sequences of locally repairable codes (LRCs) with a prescribed relative minimum distance and locality…”
Get full text

Analog Error-Correcting Codes by Roth, Ron M.

“…Coding schemes are presented that provide the ability to locate computational errors above a prescribed threshold while using analog resistive devices for…”
Get full text

Construction of Sidon Spaces With Applications to Coding by Roth, Ron M., Raviv, Netanel, Tamo, Itzhak

“…A subspace of a finite extension field is called a Sidon space if the product of any two of its elements is unique up to a scalar multiplier from the base…”
Get full text

Fault-Tolerant Dot-Product Engines by Roth, Ron M.

“…Coding schemes are presented that provide the ability to correct and detect computational errors while using dot-product engines for integer vector-matrix…”
Get full text

Two-Dimensional Maximum-Likelihood Sequence Detection Is NP Hard by Ordentlich, E., Roth, R. M.

“…A 2-D version of the classical maximum-likelihood sequence detection (MLSD) problem is considered for a binary antipodal signal that is corrupted by linear…”
Get full text

On Decoding Rank-Metric Codes Over Large Fields by Roth, Ron M.

“…A decoding algorithm is presented for a rank-metric array codes that are based on diagonal interleaving of maximum-distance separable codes. With respect to…”
Get full text

On the Pointwise Threshold Behavior of the Binary Erasure Polarization Subchannels by Ordentlich, Erik, Roth, Ron M.

“…It is shown that when Arıkan's <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula>-level polarization transformation is applied to the…”
Get full text

On the Capacity of Generalized Ising Channels by Sharov, Artyom, Roth, Ron M.

“…Nearly tight lower and upper bounds on the capacity of generalized Ising channels are presented. For the case where feedback is allowed, a closed-form…”
Get full text

On Spectral Design Methods for Quasi-Cyclic Codes by Roth, Ron M., Zeh, Alexander

“…A method is provided for constructing upper triangular square matrices over the univariate polynomial ring over a finite field, under certain constraints on…”
Get full text

On the Implementation of Boolean Functions on Content-Addressable Memories by Roth, Ron M.

“…Let <inline-formula> <tex-math notation="LaTeX">[q\rangle </tex-math></inline-formula> denote the integer set <inline-formula> <tex-math…”
Get full text

Variable-Length Constrained Coding and Kraft Conditions: The Parity-Preserving Case by Roth, Ron M., Siegel, Paul H.

“…Previous work by the authors on parity-preserving fixed-length constrained encoders is extended to the variable-length case. Parity-preserving variable-length…”
Get full text

On Bi-Modal Constrained Coding by Roth, Ron M., Siegel, Paul H.

“…Bi-modal (respectively, multi-modal) constrained coding refers to an encoding model whereby a user input block can be mapped to two (respectively, multiple)…”
Get full text

Long Cyclic Codes Over GF(4) and GF(8) Better Than BCH Codes in the High-Rate Region by Roth, Ron M., Zeh, Alexander

“…An explicit construction of an infinite family of cyclic codes is presented which, over GF(4) (resp., GF(8)), have approximately 8/9 (resp., 48/49) the…”
Get full text

Coding for Combined Block-Symbol Error Correction by Roth, Ron M., Vontobel, Pascal O.

“…We design low-complexity error correction coding schemes for channels that introduce different types of errors and erasures: on the one hand, the proposed…”
Get full text

Bounds and Constructions for Granular Media Coding by Sharov, Artyom, Roth, Ron M.

“…Bounds on the rates of grain-correcting codes are presented. The lower bounds are Gilbert-Varshamov-like ones, whereas the upper bounds improve on the…”
Get full text

Burst List Decoding of Interleaved Reed-Solomon Codes by Kolan, Tom, Roth, Ron M.

“…It is shown that interleaved Reed-Solomon codes can be list-decoded for burst errors while attaining the generalized Reiger bound for list decoding. A…”
Get full text

Low Complexity Two-Dimensional Weight-Constrained Codes by Ordentlich, E., Roth, R. M.

“…Two low complexity coding techniques are described for mapping arbitrary data to and from m × n binary arrays in which the Hamming weight of each row…”
Get full text