On the Undetected Error Probability for Shortened Hamming Codes
نویسندگان
چکیده
منابع مشابه
Exact and Approximate Expressions for the Probability of Undetected Error of Varshamov-Tenengol'ts Codes
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 discu...
متن کاملConcerning a Bound on Undetected Error Probability
In the past, it has generally been assumed that the prohability of undetected error for an (n,k) block code, used solely for error detection on a binary symmetric channel, is upperbounded by 2-‘“-k’. In this correspondence, it is shown that Hamming codes do indeed obey this bound, but that the bound is violated by some more general codes. Examples of linear, cyclic, and Bose-Chaudhuri-Hocquengh...
متن کاملQuantum error detection I: Statement of the problem
This paper is devoted to the problem of error detection with quantum codes. In the first part we examine possible problem settings for quantum error detection. Our goal is to derive a functional that describes the probability of undetected error under natural physical assumptions concerning transmission with error detection with quantum codes. We discuss possible transmission protocols with sta...
متن کاملAn alternative to the Hamming code in the class of SEC-DED codes in semiconductor memory
The II code constructed by Panchenko is studied. The If code to be an alternative to the Hamming code in the class of singleerror correcting and double-error detecting codes (SEC-DED codes) is also considered. The II code has a smaller number of words of weight 4 and provides a larger probability of the triple-independent-error detection than the shortened Hamming code with the same parameters....
متن کاملDNA Barcoding through Quaternary LDPC Codes
For many parallel applications of Next-Generation Sequencing (NGS) technologies short barcodes able to accurately multiplex a large number of samples are demanded. To address these competitive requirements, the use of error-correcting codes is advised. Current barcoding systems are mostly built from short random error-correcting codes, a feature that strongly limits their multiplexing accuracy ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Communications
دوره 33 شماره
صفحات -
تاریخ انتشار 1985