Application of the Discrete Mathematics Term Paper

Excerpt from Term Paper :

Coding Theory for Discrete Mathematics

In the contemporary IT (information technology) environment, increasing number of organizations are using large computer to transmit data over a long distance and some of these data are transmitted across billions of kilometers. During data transmission, some data can be degraded; the coding theory is an effective strategy to recover degraded data in order to guarantee reliable data transmission. Coding theory also assists in recovering and detecting errors, which assists in enhancing efficient data storage and data communications.

Objective of this paper is to discuss the coding theory and its real world application. The paper discusses the errors detecting codes and its application in the next section.

Error Detecting Codes

A simple strategy to detect errors is to add parity in order to check bit. To detect errors, a bit strong will be transmitted in order to add a parity bit. Typically, when a bit string has an even number of 1s, then we put 0 when reaching the end of the string. However, when a bit string has an odd number of 1s, then we put 1 when reaching the end of the string. When the parity check bit has been summed up with bit string and errors are detected with odd number, however errors are also detected with even numbers. For example, when receiving the following strings 1110011 and 10111101 as messages, the strings cannot be a valid codeword since we get odd numbers of 1s from the string 1110011. However, when the string of 10111101 has even numbers of 1s, the system will detect errors.

The errors can also be detected by repeating a bit within a message twice. For example, when the bit string of 011001 is repeated twice, the codeword of 001111000011 is repeated twice.

Error Correcting Codes

Some powerful codes are difficult to be detected, thus, the error correcting codes are used.

In the error correcting codes, it is easy to correct errors by including redundancy. It is also possible to correct errors by including redundancy. For example, the paper uses the triple code and repeat message three times. When the message is x1x2x3, the message is presented as x1x2x3 x4x5x6 x7x8x9

"Where x1 = x4 = x7, x2 = x5 = x8, and x3 = x6 = x9."

"The valid code words are 000000000, 001001001, 010010010, 011011011, 100100100, 101101101, 110110110, and 111111111." (Rosen 2012 p 75).

Hamming Distance

Hamming distance is the strategy to measure distance between two sets of bit strings. Hamming distance also reveals the number of positions where the bit strings differ. In essence, the hamming distance uses the coding theory to derive the fundamental work. For example, when…

Sources Used in Document:


Key, J.D. (2000). Some error-correcting codes and their applications. College of Engineering and Science Clemson University.

Moon, T.K. (2005). Error Correction Coding. New Jersey: John Wiley & Sons.

Pless, V. (1998), Introduction to the Theory of Error-Correcting Codes (3rd ed.), Wiley Interscience.

Rosen, K.H.(2012). Discrete Mathematics and Its Applications. (Seventh Edition).New York. McGraw-Hill Companies, Inc.

Cite This Term Paper:

"Application Of The Discrete Mathematics" (2015, June 08) Retrieved April 8, 2020, from

"Application Of The Discrete Mathematics" 08 June 2015. Web.8 April. 2020. <>

"Application Of The Discrete Mathematics", 08 June 2015, Accessed.8 April. 2020,