Probability Of Undetected Error Hamming Code
Request full-text Undetected error probability of hamming code for any number of symbolsConference Paper · December 2010 with 73 ReadsDOI: 10.1109/ICITIS.2010.5689650 Conference: Information Theory and Information Security (ICITIS), 2010 IEEE International Conference on1st Mukesh Gupta38.74 · National Institute of Technology Rourkela2nd Jaskaran S. Bhullar3rd Bharat Naresh BansalAbstractIn past papers, it has been shown that probability of undetected error Pu(ε) for binary (n = 2m - 1, k = n - m, 3) Hamming code (q = 2) used for error detection on binary symmetric channel satisfies the 2-p bound, where p is the parity check bits equal to n - k, hence binary Hamming codes are proper. In this correspondence this result is generalized and it has been shown that not only binary but Hamming Codes (for any value of q) satisfy this bound, so generalized Hamming codes are proper.Do you want to read the rest of this conference paper?Request full-text CitationsCitations1ReferencesReferences19Hamming encoding and decoding algorithms for TDCS and WDCS design[Show abstract] [Hide abstract] ABSTRACT: Error detection and Error correction are techniques that allow reliable delivery of information data over Communication channels in Transform Domain and Wavelet Domain communication Systems. In Communication Systems many communication channels are subject to noise and other Errors due to the channel, and thus errors may be there during transmission process from the Transmitter to a receiver. Error detection methods allow detecting such type of errors, while error correction process enables recovering of the original data. Hamming code is known for its single-bit error detection capability & Error correction capability. To provide such a capability, it introduces 4 redundancy bits in a 8-bit data item. These redundancy bits are to be interspersed at bit positions two the power n (n = 0, 1, 2, 3) with the original information. After Error detection & Error correction process, if any, the data bits have to be reassembled by removing the redundancy bits. In the proposed TDCS-WDCS hamming code up gradation the redundancy bits will be appended at the end of data bits. This removes the overhead of interspersing the added redundant bits at the TDCS-WDCS transmitter and their
be down. Please try the request again. Your cache administrator is webmaster. Generated Mon, 24 Oct 2016 14:21:39 GMT by s_wx1011 (squid/3.5.20)
be down. Please try the request again. Your cache administrator is webmaster. Generated Mon, 24 Oct 2016 14:21:39 GMT by s_wx1011 (squid/3.5.20)