There are three main types of errors in data transmission: single bit errors, where one bit is flipped; multiple bit errors, where two or more non-consecutive bits are flipped; and burst errors, where two or more consecutive bits are flipped. Coding techniques are used to detect and correct errors, including data compression to remove redundancy, error detection codes to detect errors, cryptographic coding for secure communication, and line coding for digital transmission. Modular arithmetic is used in coding theory, representing values from 0 to N-1, with values wrapping back to zero after reaching N. The Hamming distance metric compares strings by counting the number of positions with different bits, and minimum Hamming distance finds the smallest such distance between code
There are three main types of errors in data transmission: single bit errors, where one bit is flipped; multiple bit errors, where two or more non-consecutive bits are flipped; and burst errors, where two or more consecutive bits are flipped. Coding techniques are used to detect and correct errors, including data compression to remove redundancy, error detection codes to detect errors, cryptographic coding for secure communication, and line coding for digital transmission. Modular arithmetic is used in coding theory, representing values from 0 to N-1, with values wrapping back to zero after reaching N. The Hamming distance metric compares strings by counting the number of positions with different bits, and minimum Hamming distance finds the smallest such distance between code
There are three main types of errors in data transmission: single bit errors, where one bit is flipped; multiple bit errors, where two or more non-consecutive bits are flipped; and burst errors, where two or more consecutive bits are flipped. Coding techniques are used to detect and correct errors, including data compression to remove redundancy, error detection codes to detect errors, cryptographic coding for secure communication, and line coding for digital transmission. Modular arithmetic is used in coding theory, representing values from 0 to N-1, with values wrapping back to zero after reaching N. The Hamming distance metric compares strings by counting the number of positions with different bits, and minimum Hamming distance finds the smallest such distance between code
There are three main types of errors in data transmission: single bit errors, where one bit is flipped; multiple bit errors, where two or more non-consecutive bits are flipped; and burst errors, where two or more consecutive bits are flipped. Coding techniques are used to detect and correct errors, including data compression to remove redundancy, error detection codes to detect errors, cryptographic coding for secure communication, and line coding for digital transmission. Modular arithmetic is used in coding theory, representing values from 0 to N-1, with values wrapping back to zero after reaching N. The Hamming distance metric compares strings by counting the number of positions with different bits, and minimum Hamming distance finds the smallest such distance between code
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1/ 3
Types of errors
There are three main types of errors namely
1. Single bit error This is where one bit of data changes from 0 to 1 and 1 to 0, for example, an 8-bit data 0 0 0 0 0 0 1 0 is being sent by the sender and when the data reaches its destination 0 0 0 0 1 0 1 0 it changes to
0 0 0 0 0 0 1 0 0 0 0 0 1 0 1 0
sender receiver
In frame, there is only one bit located anywhere which is corrupt.
2. Multiple bits error
Two or more non-consecutive (not in a sequence) bits in a data unit changes from 1 to 0 and 0 to 1. For example Sent 0 0 0 0 0 0 1 1
Received 1 0 0 1 0 0 1 0
The frames are received with more than one bit in
corrupted state.
3. Burst error Two or more consecutive (in a sequence) bits changes from 0 to 1 and 1 to 0. For example sent 0 0 0 0 0 0 1 0
received 0 1 1 1 0 0 1 0
Frame contains more than 1 bits corrupted.
Coding Coding in data communications and computer networks is are a system of rules that converts information into another form. Its technical term is encoding and it converts information from a source into symbols for communication or storage. Types of codes are
I. Data compression This removes the redundancy from the data from a source in order to transmit it more effectively. Has the ability to make data files smaller for reducing internet traffic II. Error detection These are a sequence of numbers that are generated by specific procedures for detecting errors in data that has been transmitted over computer networks. When bits are transmitted over the computer network, they are subject to get corrupted. III. Cryptographic coding It is a practice and a study of techniques for secure communication in the presence of third parties. It constructs protocols that adversaries are central to modern cryptography. IV. Line coding
It is a code chosen for use within a communications system for baseband transmission purposes. It is often used for digital transport.
Modular arithmetic
Modular arithmetic is a system of arithmetic for integers, where values reset to zero and begin to increase again, after reaching a certain predefined value, called the modulus (modulo). Modular arithmetic is widely used in computer science and cryptography. The values are limited rom 1 and 0 and the upper limit is defined as N and we have 0 to N-1 Zn be a set of all non-negative integers that are smaller than N: ZN = {0,1, 2..., N-1} where: N is a positive integer, if N is a prime, it will be denoted p (and the whole set as Zp). In this system. When an integer is greater than N, it is divided by N where the remainder is the result.
Block coding
It is also known as block-based programming, which is a type of programming where instructions are mainly represented as blocks. Messages are divided into blocks each of Kbits. These codes can also be applied in the domains of telecommunications, information theory and coding theory.
Hamming distance
This is a metric for comparing two binary data strings. It is used for error detection or error correction
In order to calculate the Hamming distance between two strings, and we perform their XOR operation, (a⊕ b), and then count the total number of 1s in the resultant string.
When data is transmitted over computer networks and it uses a coding theory for comparing equal length data words. Mainly found when using a mutually exclusive OR gate pathways on the corresponding bits. Suppose there are two stings 1101 1001 and 1001 1101 then 1101 1001 ⊕ 1001 1101 = 01000100 since this contains two 1’s , the hammering distance d(11011001, 10011101) = 2. Minimum humming distance
The minimum Hamming distance is the smallest Hamming distance between all possible pairs. It uses "dmin" to define the minimum Hamming distance in a coding scheme. To find this value, it locates the Hamming distances between all words and select the smallest one.
