Zobrazeno 1 - 10
of 148
pro vyhledávání: '"Kløve, Torleiv"'
Binary linear [n,k] codes that are proper for error detection are known for many combinations of n and k. For the remaining combinations, existence of proper codes is conjectured. In this paper, a particular class of [n,k] codes is studied in detail.
Externí odkaz:
http://arxiv.org/abs/1111.5484
Autor:
Kløve, Torleiv, Luo, Jinquan
There is a known best possible upper bound on the probability of undetected error for linear codes. The $[n,k;q]$ codes with probability of undetected error meeting the bound have support of size $k$ only. In this note, linear codes of full support (
Externí odkaz:
http://arxiv.org/abs/1102.2350
An (n,d) permutation array (PA) is a set of permutations of length n with the property that the distance (under some metric) between any two permutations in the array is at least d. They became popular recently for communication over power lines. Mot
Externí odkaz:
http://arxiv.org/abs/0907.2682
Publikováno v:
IEEE Transactions on Information Theory, ISSN 0018-9448, Vol. 54, No. 11, pp. 5019-5029, Nov. 2008
Computation of the undetected error probability for error correcting codes over the Z-channel is an important issue, explored only in part in previous literature. In this paper we consider the case of Varshamov-Tenengol'ts codes, by presenting some a
Externí odkaz:
http://arxiv.org/abs/0712.2245
Distance-preserving mappings (DPMs) are mappings from the set of all q-ary vectors of a fixed length to the set of permutations of the same or longer length such that every two distinct vectors are mapped to permutations with the same or even larger
Externí odkaz:
http://arxiv.org/abs/0704.1358
Autor:
Naydenova, Irina, Klove, Torleiv
Linear codes for error detection on a q-ary symmetric channel are studied. It is shown that for given dimension k and minimum distance d, there exists a value \mu(d,k) such that if C is a code of length n >= \mu(d,k), then neither C nor its dual are
Externí odkaz:
http://arxiv.org/abs/cs/0508035
Autor:
Kløve, Torleiv
Publikováno v:
Mathematics of Computation, 1975 Oct 01. 29(132), 1144-1149.
Externí odkaz:
https://www.jstor.org/stable/2005755
