36 citations · 83 across the 10 of their papers we have counts for
12 papers
Coding and Bounds for Partially Defective Memory Cells
Haider Al Kim, Sven Puchinger, Ludo Tolhuizen +1
This paper considers coding for so-called partially stuck (defect) memory cells. Such memory cells can only store partial information as some of their levels cannot be used fully d…
Maximum weight spectrum codes with reduced length
Gerard D Cohen, Ludo Tolhuizen
A q-ary linear code of dimension k is called a maximum weight spectrum (MWS) code if it has the maximum possible number (viz. (q^k-1)/(q-1)) of different non-zero weights. We const…
A Multi-layer Recursive Residue Number System
Henk D. L. Hollmann, Ronald Rietman, Sebastiaan de Hoogh +2
We present a method to increase the dynamical range of a Residue Number System (RNS) by adding virtual RNS layers on top of the original RNS, where the required modular arithmetic…
The MMO problem
Oscar Garcia-Morchon, Ronald Rietman, Ludo Tolhuizen +2
We consider a two polynomials analogue of the polynomial interpolation problem. Namely, we consider the Mixing Modular Operations (MMO) problem of recovering two polynomials $f\in…
Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values
Oscar Garcia-Morchon, Ronald Rietman, Igor E. Shparlinski +1
Motivated by a recently introduced HIMMO key distribution scheme, we consider a modification of the noisy polynomial interpolation problem of recovering an unknown polynomial $f(X)…
A generalisation of the Gilbert-Varshamov bound and its asymptotic evaluation
Ludo Tolhuizen
The Gilbert-Varshamov (GV) lower bound on the maximum cardinality of a q-ary code of length n with minimum Hamming distance at least d can be obtained by application of Turan's the…