36 citations · 40 across the 4 of their papers we have counts for
4 papers
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…
Entropy of a bit-shift channel
Stan Baggen, Vladimir Balakirsky, Dee Denteneer +4
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 resul…
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…
Generating parity check equations for bounded-distance iterative erasure decoding
Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen
A generic -erasure correcting set is a collection of vectors in $\bF_2^r$ which can be used to generate, for each binary linear code of codimension , a collection of pari…