Encoding process, Computer Networking

Encoding Process

c= uG

u: binary data sequence of length 4( input)

G: Generator matrix which is 7*4

c: Codeword

 

 

797_Encoding Process.png

Decoding Process

s= rHT

r: received data sequence of length 7 ( input) H: Parity-Check Matrix

s: Syndrome to check error-position

 

 

1855_Encoding Process1.png

If some output values of the encoding and decoding multiplication is over than 1, the value should be changed into remainder on division of itself by 2.  (Ex: (4 2 1 ) => (0 0 1))

 

s(Syndrome) detect error position. We can know the single-error-bit position in the table below.

234_Encoding Process2.png

Fig. Decoding table for Hamming code(7,4)

If s is [0 0 0] and r= [0 1 0 0 0 1 1], it supposes that there is no error and transmitted data is [0 0 1 1]. If s is [0 1 0] and r = [1 0 1 0 0 1 0], it supposes that 2th bit is corrupted, so r should be changed to [1 1 1 0 0 1 0], and transmitted data is lower 4bits, [0 0 1 0].

Posted Date: 2/19/2013 1:12:08 AM | Location : United States







Related Discussions:- Encoding process, Assignment Help, Ask Question on Encoding process, Get Answer, Expert's Help, Encoding process Discussions

Write discussion on Encoding process
Your posts are moderated
Related Questions
Cut-Through is the best mode of switching. Store and Forward reads in the whole frame, confirms the frame is valid, and then forwards the frame onto the wire. Cut-Through only chec

What is multicast routing? Sending a message to a group is known as multicasting, and its routing algorithm is known as multicast routing.

OSI= Open System Interconnection.

1. Introduction This document describes the research-based assignment for this module. This assignment consists of two parts: A formal report And a presentatio

In this project, you will implement a Transport Layer protocol to transmit data with Reliable Data Transfer from a client to a server in the presence of channel errors and loss. Th

DISTANCE-VECTOR ROUTING: It is easy to implement. Packet switch modifies its own routing table first. It is used in RIP. LINK-STATE ALGORITHM: It is ve


Unused Reserved This  is a 6 bite field  reserved for future use.

How can I identify the difference types of networks