Exact and Approximate Expressions for the Probability of Undetected Error of Varshamov-Tenengol'ts Codes
Marco Baldi, Franco Chiaraluce, Torleiv Kl{\o}ve
TL;DR
This paper investigates the undetected error probability of Varshamov-Tenengol'ts codes over the Z-channel, providing analytical, numerical, and heuristic methods, and comparing them with Hamming codes.
Contribution
It introduces new exact and approximate formulas for undetected error probability of Varshamov-Tenengol'ts codes and compares their performance with Hamming codes.
Findings
Derived analytical expressions for undetected error probability.
Developed numerical and heuristic methods for estimation.
Compared Varshamov-Tenengol'ts codes with Hamming codes.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Coding theory and cryptography · Radiation Effects in Electronics