5 citations · 9 across the 5 of their papers we have counts for
5 papers
A class of punctured simplex codes which are proper for error detection
Marco Baldi, Marco Bianchi, Franco Chiaraluce +1
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.…
The best possible upper bound on the probability of undetected error for linear codes of full support
Torleiv Kløve, Jinquan Luo
There is a known best possible upper bound on the probability of undetected error for linear codes. The codes with probability of undetected error meeting the bound have…
Permutation Arrays Under the Chebyshev Distance
Torleiv Kløve, Te-Tsung Lin, Shi-Chun Tsai +1
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…
Exact and Approximate Expressions for the Probability of Undetected Error of Varshamov-Tenengol'ts Codes
Marco Baldi, Franco Chiaraluce, Torleiv Kløve
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…
Codes for error detection, good or not good
Irina Naydenova, Torleiv Klove
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 μ(d,k) such that if C…