Torleiv Klove

Learn More
We study single error-correcting codes for the asymmetric channel with input and output alphabets being {0, 1 ..... a 1/. From an abe|ian group G of order N with elements go = O, gl ..... gN 1, Constantin and Rao (1979, Inform. Contr. 40, 20-36) define Vg = {(b~, b2 ..... bN1) C {0, 1 ..... a -1 }N-I I Z~-,' b~gi = g} and show that Vg correct single errors.(More)
Computation of the undetected error probability for error detecting codes over the Z-channel is an important issue, explored only in part in previous literature. In this paper, Varshamov-Tenengol'ts (VT) codes are considered. First, an exact formula for the probability of undetected errors is given. It can be explicitly computed for small code lengths (up(More)
The maximum of g/sub 2/ - d/sub 2/ for linear [n,k,d;q] codes C is studied. Here d/sub 2/ is the smallest size of the support of a two-dimensional subcode of C and g/sub 2/ is the smallest size of the support of a two-dimensional subcode of C which contains a codeword of weight d. For codes of dimension 4 or more, upper and lower bounds on the maximum of(More)
Codes that can correct up to <i>t</i> symmetric errors and detect all unidirectional errors are studied. BOumlinck and van Tilborg gave a bound on the length of binary such codes. A generalization of this bound to arbitrary alphabet size is given. This generalized BOumlinck-van Tilborg bound, combined with constructions, is used to determine some optimal(More)
  • 1