0% found this document useful (0 votes)
8 views

Document

its a cloud computing document

Uploaded by

sureshroopa2k15
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
8 views

Document

its a cloud computing document

Uploaded by

sureshroopa2k15
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Implement bit stuffing error detection

import java.util.*;
public class bit_stuffing
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
System.out.print("Enter the message:-");
String d1 = sc.nextLine();
String remaining = new String();
String output=new String();
int counter = 0;
for(int i=0;i<d1.length();i++)
{

if (d1.charAt(i)!='1' && d1.charAt(i)!='0')


{
System.out.println("Enter valid Binary
values");
return;
}
if(d1.charAt(i) == '1')
{
counter++;
remaining = remaining + d1.charAt(i);
}
else
{
remaining = remaining + d1.charAt(i);
counter = 0;
}
if(counter == 5)
{
remaining = remaining + '0';
counter = 0;
}
}
System.out.println("Flag--> 01111110");
String new1="|01111110 | "+remaining+" | 01111110|";
System.out.println("Stuffed data at intermediate site is:");
for(int k=0;k<=(28+d1.length());k++)
{
System.out.print("-");
}
System.out.println();
System.out.println(" "+new1);
for(int k=0;k<=(28+d1.length());k++)
{
System.out.print("-");
}
System.out.println();
counter=0;
for(int i=0;i<remaining.length();i++)
{

if(remaining.charAt(i) == '1')
{

counter++;
output = output + remaining.charAt(i);

}
else
{
output = output + remaining.charAt(i);
counter = 0;
}
if(counter == 5)
{
if((i+2)!=remaining.length())
{
output = output + remaining.charAt(i+2);
}
else
{
output=output + '1';
}
i=i+2;
counter = 1;
}
}
System.out.println("Destuffed BIT is: "+output);
}
}

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy