, , , , , . .

 

 

!

 

:

:

 

 

 

?

StudentHelp, , MS Word. , , antiplagiat.ru, etxt.ru advego.ru. StudentHelp , Word .


:


:

: . : 31.05.2012. : 2011. : 15. antiplagiat.ru: < 30%

():



-97161


,
. -
堠 . ࠠ , -
, , ,
,
. , ,
,
PC.



-97161



1.
............................................................................
............... 6
2. ࠠ
..........................................................................
7
3. 蠠 䠠 蠠
............................................. 8
4. 
....................................... 9
4.1. R(x) ...... 11
4.2.

............................................................................
.............. 14
5. ࠠ
........................................................... 15
6. ࠠ ࠠ
......................................................... 16
7.
....................................................... 21
----------------------------------------------------------------------------
------------------------

............................................................................
............ 23
堠 1
............................................................................
... 24
堠 2
............................................................................
... 30



1

,,
頠 蠠 堠 頠
( ,
-).
, 蠠 頠頠
.
頠䠠 ꠠ, , ,
.
  堠 蠠 ⠠
, 蠠 䠠
蠠 ꠠ 젠 䠠 蠠 (
).

.
. -

.
⠠̠ 蠠
.



( 2

31 頠
( n=31 ,s=1)
.
蠠頠
. ,
,
.



( 3
1. x:
G(x)=x4+x2+1 ( 0010101;
G(x)(x=x5+x3+x ( 0101010.
2. 2 .
:
G1(x)+G2(x)=>G3(x);
G1(x) -G2(x)=>G3(x);
G2(x)+G1(x)=>G3(x);
:
G1(x)= x5 +x3+x;
G2(x)=x4 +x3 +1;
G3(x)=G1(x) ( G2(x) = x5 +x4+x+1.

3. ,
2 :

G1(x)=x6+x4+x3 ;
G2(x)=x3+x2+1 .

x6+x4+x3 x3+x2+1
( x6+x5+x3 x3 +x2
x5 + x4
( x5 + x4 +x2
x2
:

1011000 1101
(1101 1100
1100
( 1101
100

.



( 4

⠠ ࠠ
. -,

,.. 蠠 蠠
.
xn+1.
.
,
k- Q(x) xr ,
P(x) , r.   Q(x) xr
, Q(x), - r.
xrQ(x) C(x)
, Q(x).
Q(x) xr R(x)



(((( = C(x) + ((( , (1)

P(x) P(x)
R(x) - Q(x) xr P(x).
C(x) , Q(x)
, C(x)
k- . ,
, ..
(r-1). , R(x)
r.
(1) P(x)
:
F(x) = C(x) P(x) = Q(x) xr + R(x) (2)
, n-
:
1) Q(x) xr
R(x) ,
Q(x) xr P(x);
2) C(x) k-
P(x).
蠠 ⠠젠 젠
-
k , (n-k)
.
堠 ⠠-

, .



( 4.1 R(x)

31
( n=31, s=1)
.
1. - m :
m = log2 (n+1) = log2 (31+1) = 5.
2. k :
k = n-m = 26,
. (31, 26 ) - .
3. 젠 頠 ,頠
k-:
G(x)=00000000000000000000000101= x2 +1.
4. 㠠 m=n-k=5 .堠 G(x)
xm :
xm G(x)= (x2+1) x5= x7+ x5 =0000000000000000000000010100000.
5. 頠 -P(x)  堠
. (d0=3)
P(x) m=n-k=5
d0 =3.
P(x) :
P(x)= x5 + x4 +x3 +x 2 +1 = 111101.
6. 젠 R(x) G(x)(x m -
P(x)
x7+ x5 x5 + x4 +x3 +x 2 +1
10100000 111101
x7 + x6 +x5 +x 4 +x2 x2 +x +1 111101
111
x6 + x4 +x2
101010
x6 + x5 +x4 +x 3 +x 111101
x5 + x3 +x2 +x
101110
x5 + x4 +x3 +x 2 +1
111101
x4 +x +1
10011

R(x)= x4+x+1 =10011.
7. F(x) :
F(x)=xm G(x)(R(x)= x7+ x5+ x4+x+1 =0000000000000000000000010110011.
8. ⠠ 蠠ࠠ ࠠ ⠠
, :
F((x)=F(x) ( E(x)= 1000000000000000000000010110011.
9. F1(x) 頠-
, (
) W (S
1000000000000000000000010110011 111101
111101
111010
111101
111000
111101
101000
111101
101010
111101
101110
111101
100110
111101
110110
111101
101100
111101
100010
111101
111110
111101
110010
111101
111111
111101
100011
111101
11110
w
w>s .



10.
.9 w ( s.

a) 0000000000000000000000101100111 111101
111101
100011
111101
111101
111101
1 ( w=s .
2 :
0000000000000000000000101100111
( 1
0000000000000000000000101100110

1
0000000000000000000000010110011
, .



4.2


31
( n=31, s=1)
31 .
.

1. ,
k-:
G(x)=00000000000000000000000101= x2 +2.
2.
00000000000000000000000101
111101
00000000000000000000000101
00000000000000000000000101
00000000000000000000000101
00000000000000000000000101
00000000000000000000000101
0000000000000000000000011001001

3.
4.1.



( 5.

Ciclic code





















( 6.


.   ,

.
Program Cyclic_Code;
Uses
Crt,_CC31,_Serv;
Var
m,mm:Move_code;
p:Polinom;
r:Rest;
i,Mainflag,From,Error:integer;
Switch:byte;
Key:boolean;
begin
Repeat
Key:=true;
TextColor(11);
TextBackGround(7);
Clrscr;
SetWindow(24,10,45,14,2,' ');
Switch:=GetMainMenuChoice;
case Switch of
1:begin
About;
Readln;
Key:=False;
end;
2: begin
TextColor(0);
ClrScr;
SetWindow(25,10,40,13,1,' ');
Switch:=GetSubMenuChoice;
case Switch of
1:begin
TextBackGround(0);
TextColor(15);
ClrScr;
SetWindow(1,1,79,24,2,' ');
TextColor(14);



GotoXY(2,2);
Init(m,p,r,MainFlag);
Write( ');
TextColor(2);
for i:=n downto 0 do
begin
if(i0) do
begin
for i:=n downto 1 do
m6[i]:=m6[i-1];
dec(k);
end;
for i:=n1-1 downto 0 do
m6[i]:=0;
end;
Procedure Divizion(var m2:Move_code;var r2:Rest;
p2:Polinom;var flag:integer);
label
RETURN;
var
i,j,i1,kol,Countzero:integer;
begin
j:=n;
RETURN:while((j>=0)and(m2[j]=0))do dec(j);
if(j>n1)
then begin
for i:=n1 downto 0 do
begin
r2[i]:=m2[j];
dec(j);
end;
while(j>=0)do
begin
for i:=n1 downto 0 do
r2[i]:=r2[i] xor p2[i];
i1:=n1;
while((i1>=0)and(r2[i1]=0))do dec(i1);
if(i1=-1)then goto RETURN;
Kol:=n1-i1;
while(Kol>0)do
begin
for i:=n1 downto 1 do
r2[i]:=r2[i-1];
dec(Kol);
end;
Kol:=n1-i1;
while((Kol>0)and(j>=0))do
begin
r2[Kol-1]:=m2[j];
dec(Kol);
dec(j);
end;
if((j=-1)and(Kol=0))
then begin
for i:=n1 downto 0 do
r2[i]:=r2[i] xor p2[i];
end
else flag:=Kol;
end;
end
else if(n1=j)
then begin
for i:=n1 downto 0 do
begin
r2[i]:=m2[j];
dec(j);
end;
for i:=n1 downto 0 do
r2[i]:=r2[i] xor p2[i]
end
else if(j0)then
begin
k:=n1-flag;
for i:=n1 downto flag do
begin
m3[k]:=r3[i];
dec(k);
end;
end



else begin
for i:=n1-1 downto 0 do
m3[i]:=r3[i];
end;
end;
Procedure MakeError(var m4:Move_code;var err:integer);
begin
Randomize;
err:=Random(n);
m4[err]:=m4[err] xor 1;

end;
Procedure Decoder(var m6:Move_Code);
var
i:integer;
k:byte;
begin
k:=5;
while(k>0) do
begin
for i:=0 to n-1 do
..................



90% antiplagiat.ru, etxt.ru advego.ru




* . , .