Rank: 3087 based on 42 downloads (last 30 days) and 1 file submitted
photo

ahmed shehab

E-mail
Company/University
islamic University -Gaza

Personal Profile:
Professional Interests:
Communications

 

Watch this Author's files

 

Files Posted by ahmed
Updated   File Tags Downloads
(last 30 days)
Comments Rating
24 Feb 2011 reed solomon code everything about RS generation and generation polynomial and encoding and syndrome Author: ahmed shehab communications, help 42 4
  • 5.0
5.0 | 3 ratings
Comments and Ratings by ahmed View all
Updated File Comments Rating
30 May 2011 Gram schmidth Algorithm Gram schmidth Algorithm implemented in MATLAB. Author: Khan Sadaf

28 Jan 2011 reed solomon code everything about RS generation and generation polynomial and encoding and syndrome Author: ahmed shehab

i finished RS decoding and i get error location polynomial and error evaluator polynomial

28 Dec 2010 reed solomon code everything about RS generation and generation polynomial and encoding and syndrome Author: ahmed shehab

am finished now making function that find error location by Berlekamp-Massey algorithm

28 Mar 2010 Reed-Solomon errors-and-erasures decoder An errors-and-erasures decoder for Reed-Solomon codes based on the Massey-Berlekamp algorithm Author: Jaco Versfeld

my Graduation Project is about Reed-Solomon codes...
o the first thing we must do it is how to generate finite field by using matlab

28 Mar 2010 Extended Euclidean Algorithm for polynomials over GF(2^m) Implementation of the extended Euclidean algorithm for polynomials over GF(2^m) Author: Jaco Versfeld

sorry i mean like this
this is function is Y=generation(N,X)
N is number of bits
X is the generation polynomial function example X^3+X+1;
i need it to extensions to the binary field- finite field GF(2^m);
if i input Y=generation(8,[1 0 1 1])
the output is
000
001
010
100
011
110
111
101
............................
am make one put i have error this is
....................................................
function Y=generation1(N,X)
N>=0;
K=log2(N);
Y(2:K+1,1:K)=eye(K,K);
Yp=Y(2,1:K);
for i=1:N-(K+1)
Yn=Yp(K);
for j=1:K
Z=xor(Yp(j),Yp(K));
Yn(j+1)=xor(Z,X(j+1));
end
Y(K+2+i,:)=Yn(j+1);
Yp=Yn;

end

Comments and Ratings on ahmed's Files View all
Updated File Comment by Comments Rating
27 Nov 2013 reed solomon code everything about RS generation and generation polynomial and encoding and syndrome Author: ahmed shehab Dinu

21 Jul 2013 reed solomon code everything about RS generation and generation polynomial and encoding and syndrome Author: ahmed shehab King, Kevin

good work

04 Jun 2013 reed solomon code everything about RS generation and generation polynomial and encoding and syndrome Author: ahmed shehab tai tu

how can I run this program ?

25 May 2011 reed solomon code everything about RS generation and generation polynomial and encoding and syndrome Author: ahmed shehab Sadaf, Khan

28 Jan 2011 reed solomon code everything about RS generation and generation polynomial and encoding and syndrome Author: ahmed shehab shehab, ahmed

i finished RS decoding and i get error location polynomial and error evaluator polynomial

Contact us