Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Tolhuizen, Ludo"'
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 due to, e.g., wearout. First, we present new constructions that are abl
Externí odkaz:
http://arxiv.org/abs/2202.07541
Autor:
Cohen, Gerard D, Tolhuizen, Ludo
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 construct MWS codes from quasi-minimal codes, thus obtaining of much shorte
Externí odkaz:
http://arxiv.org/abs/1806.05427
Autor:
Hollmann, Henk D. L., Rietman, Ronald, de Hoogh, Sebastiaan, Tolhuizen, Ludo M. G. M., Gorissen, Paul
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 for a modulus on any non-bottom layer is implemented by means of an RN
Externí odkaz:
http://arxiv.org/abs/1801.07561
Autor:
von Wagner, Michael, Queck, Alexander, Beekers, Pim, Tolhuizen, Ludo, Synnatschke, Anne, Boesing, Josee, Chatterjea, Supriyo
Publikováno v:
International Journal of Healthcare Management; Jun2024, Vol. 17 Issue 2, p215-226, 12p
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 \Z_p[x]$ and $g\in \Z_q[x]$ of known degree, where $p$ and $q$ are two
Externí odkaz:
http://arxiv.org/abs/1401.7532
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) \in Z[X]$ from approximate values of the residues of $f(t)$ modulo a
Externí odkaz:
http://arxiv.org/abs/1401.1331
Autor:
Tolhuizen, Ludo
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 theorem to the graph with vertex set {0,1,..,q-1}^n in which two vertices
Externí odkaz:
http://arxiv.org/abs/1106.6206
Autor:
Tolhuizen, Ludo
We provide bounds for codes for a non-symmetric channel or, equivalently, for ternary codes with the Manhattan distance.
Comment: To be presented at 31st WIC Symposium on Information Theory in the Benelux, Rotterdam, the Netherlands, May 11-12,
Comment: To be presented at 31st WIC Symposium on Information Theory in the Benelux, Rotterdam, the Netherlands, May 11-12,
Externí odkaz:
http://arxiv.org/abs/1004.1511
In 2007, Martinian and Trott presented codes for correcting a burst of erasures with a minimum decoding delay. Their construction employs [n,k] codes that can correct any burst of erasures (including wrap-around bursts) of length n-k. The raised the
Externí odkaz:
http://arxiv.org/abs/0712.2182
Autor:
Baggen, Stan, Balakirsky, Vladimir, Denteneer, Dee, Egner, Sebastian, Hollmann, Henk, Tolhuizen, Ludo, Verbitskiy, Evgeny
Publikováno v:
IMS Lecture Notes--Monograph Series 2006, Vol. 48, 274-285
We consider a simple transformation (coding) of an iid source called a bit-shift channel. This simple transformation occurs naturally in magnetic or optical data storage. The resulting process is not Markov of any order. We discuss methods of computi
Externí odkaz:
http://arxiv.org/abs/math/0608254