Abstract

This paper presents a review of the Algorithmic method of Hamming codes techniques for detection and correction of computational errors in a binary coded data, analysis in an integer sequence A119626. This integer sequence is obtained from computing the difference in the number of inverted pairs of the first and the last cycles which in turn is obtained from a special (123)-avoiding permutation pattern. The computation in this paper was restricted to values of n = 1, 2, 3, 4, and 5 respectively. This paper simply considered the execution time (T) and rate (R) for any given time t of the algorithmic method of analysis based on the number of iterations (steps) involved in the general procedure of encoding, detection and correction of errors for all the values of n.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call