36 citations · 83 across the 10 of their papers we have counts for
8 papers · 1 filter
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 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…
Bounds for codes for a non-symmetric ternary channel
Ludo Tolhuizen
We provide bounds for codes for a non-symmetric channel or, equivalently, for ternary codes with the Manhattan distance.
Optimal codes for correcting a single (wrap-around) burst of errors
Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen
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…
On q-ary codes correcting all unidirectional errors of a limited magnitude
R. Ahlswede, H. Aydinian, L. H. Khachatrian +1
We consider codes over the alphabet Q={0,1,..,q-1}intended for the control of unidirectional errors of level l. That is, the transmission channel is such that the received word can…