Skip to content
Browse files
spelling fixes
  • Loading branch information
jef-n committed Aug 17, 2017
1 parent e325895 commit fad5973
Show file tree
Hide file tree
Showing 2 changed files with 2 additions and 2 deletions.
@@ -189,7 +189,7 @@ void dwgCompressor::decompress18( duint8 *cbuf, duint8 *dbuf, duint32 csize, dui
pos = 0; //current position in compressed buffer
rpos = 0; //current position in resulting decompressed buffer
litCount = litLength18();
//copy first lileral length
//copy first literal length
for ( duint32 i = 0; i < litCount; ++i )
bufD[rpos++] = bufC[pos++];
@@ -412,7 +412,7 @@ bool RScodec::encode( unsigned char *data, unsigned char *parity )
evaluating, storing the syndromes in s[i], i=1..2tt (leave s[0] zero) .
Then we use the Berlekamp iteration to find the error location polynomial
elp[i]. If the degree of the elp is >tt, we cannot correct all the errors
and hence just put out the information symbols ian-overridesped. If the degree of
and hence just put out the information symbols unmodified. If the degree of
elp is <=tt, we substitute alpha**i , i=1..n into the elp to get the roots,
hence the inverse roots, the error location numbers. If the number of errors
located does not equal the degree of the elp, we have more than tt errors

0 comments on commit fad5973

Please sign in to comment.