#### Filter Results:

- Full text PDF available (1)

#### Publication Year

2004

2016

- This year (0)
- Last 5 years (1)
- Last 10 years (3)

#### Co-author

#### Journals and Conferences

Learn More

- Fang-Wei Fu, Torleiv Klove
- IEEE Transactions on Information Theory
- 2004

In this correspondence, two new constructions of permutation arrays are given. A number of examples to illustrate the constructions are also provided.

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)

- Torleiv Klove
- IEEE Transactions on Information Theory
- 2016

Linear covering codes and covering sets for the limited-magnitude-error channel are studied. Two new general covering set constructions are given.

- Marco Baldi, Franco Chiaraluce, Torleiv Klove
- IEEE Transactions on Information Theory
- 2008

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)

- Wende Chen, Torleiv Klove
- IEEE Transactions on Information Theory
- 2004

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)

- Irina Naydenova, Torleiv Klove
- IEEE Transactions on Information Theory
- 2007

Bose and Lin introduced a class of systematic codes for detection of binary asymmetric errors. In this note, we describe a generalization to q-ary asymmetric error detecting codes. For these codes, the possible undetectable errors are characterized and the undetectable errors of minimum weight are determined

- Irina Naydenova, Torleiv Klove
- IEEE Transactions on Information Theory
- 2009

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)

- Tor Helleseth, Torleiv Klove, V.I. Levenshtein
- 2006 IEEE International Symposium on Informationâ€¦
- 2006

A new upper bound on the cardinality of codes in the Hamming space with given minimum and maximum distances is proved. The bound is compared to some known bounds, and some classes of codes for which the new bound is tight are given

- Irina Naydenova, Torleiv Klove
- 2006 IEEE Information Theory Workshop - ITW '06â€¦
- 2006

Large codes are proper for error detection. In this paper we discuss how large is large. Using some known lemmas and theorems for proper codes we give a lower bound for the size of the code to be proper for error detection

- â€¹
- 1
- â€º