21 citations · 31 across the 10 of their papers we have counts for
16 papers
On the Implementation of Boolean Functions on Content-Addressable Memories
Ron M. Roth
Let denote the integer set and let . The problem of implementing functions on content-addr…
Higher-Order MDS Codes
Ron M. Roth
An improved Singleton-type upper bound is presented for the list decoding radius of linear codes, in terms of the code parameters [n,k,d] and the list size L. L-MDS codes are then…
Asymptotic Bounds on the Rate of Locally Repairable Codes
Ron M. Roth
New asymptotic upper bounds are presented on the rate of sequences of locally repairable codes (LRCs) with a prescribed relative minimum distance and locality over a finite field $…
Variable-Length Constrained Coding and Kraft Conditions: The Parity-Preserving Case
Ron M. Roth, Paul H. Siegel
Previous work by the authors on parity-preserving fixed-length constrained encoders is extended to the variable-length case. Parity-preserving variable-length encoders are formally…
On the Number of Factorizations of Polynomials over Finite Fields
Rachel N. Berman, Ron M. Roth
Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomi…
On Bi-Modal Constrained Coding
Ron M. Roth, Paul H. Siegel
Bi-modal (respectively, multi-modal) constrained coding refers to an encoding model whereby a user input block can be mapped to two (respectively, multiple) codewords. In current s…