Exact and Approximate Expressions for the Probability of Undetected Error of Varshamov-Tenengol'ts Codes
classification
💻 cs.IT
math.IT
keywords
codeserrorprobabilityundetectedvarshamov-tenengoladditionalanalyticalapproximate
read the original abstract
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 analytical, numerical, and heuristic methods for unveiling this additional feature. Possible comparisons with Hamming codes are also shown and discussed.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.