Quelle decoding.tst Sprache: unbekannt

##
###################### GUAVA test file
##
## Created 02-2016; Joe Fields
##
gap> h:=[[0,0,0,1,1,1,1],
>        [0,1,1,0,0,1,1],
>        [1,0,1,0,1,0,1]];
[ [ 0, 0, 0, 1, 1, 1, 1 ], [ 0, 1, 1, 0, 0, 1, 1 ], [ 1, 0, 1, 0, 1, 0, 1 ] ]
gap> C := CheckMatCode(h,GF(2));
a linear [7,4,1..3]1 code defined by check matrix over GF(2)
gap> HasSpecialDecoder(C);
false
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> j := Decode(C,c);;
gap> (i=j);
true
gap> w := Decodeword(C,c);;
gap> (c=w);
true
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> e := ErrorVector(Random([1..WordLength(C)]), C);;
gap> j := Decode(C,c+e);;
gap> (i=j);
true
gap> w := Decodeword(C,c+e);;
gap> (c=w);
true
gap> C := GeneratorMatCode(h,GF(2));
a linear [7,3,1..4]2..3 code defined by generator matrix over GF(2)
gap> HasSpecialDecoder(C);
false
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> j := Decode(C,c);;
gap> (i=j);
true
gap> w := Decodeword(C,c);;
gap> (c=w);
true
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> e := ErrorVector(Random([1..WordLength(C)]), C);;
gap> j := Decode(C,c+e);;
gap> (i=j);
true
gap> w := Decodeword(C,c+e);;
gap> (c=w);
true
gap> C := HammingCode( 5, GF(2) );
a linear [31,26,3]1 Hamming (5,2) code over GF(2)
gap> HasSpecialDecoder(C);
true
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> j := Decode(C,c);;
gap> (i=j);
true
gap> w := Decodeword(C,c);;
gap> (c=w);
true
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> e := ErrorVector(Random([1..WordLength(C)]), C);;
gap> j := Decode(C,c+e);;
gap> (i=j);
true
gap> w := Decodeword(C,c+e);;
gap> (c=w);
true
gap> C := HammingCode( 3, GF(9) );
a linear [91,88,3]1 Hamming (3,9) code over GF(9)
gap> HasSpecialDecoder(C);
true
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> j := Decode(C,c);;
gap> (i=j);
true
gap> w := Decodeword(C,c);;
gap> (c=w);
true
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> e := ErrorVector(Random([1..WordLength(C)]), C);;
gap> j := Decode(C,c+e);;
gap> (i=j);
true
gap> w := Decodeword(C,c+e);;
gap> (c=w);
true
gap> C := BCHCode( 15, 1, 5, GF(2) ); #Narrow sense BCH code (b=1)
a cyclic [15,7,5]3..5 BCH code, delta=5, b=1 over GF(2)
gap> HasSpecialDecoder(C);
true
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> j := Decode(C,c);;
gap> (i=j);
true
gap> w := Decodeword(C,c);;
gap> (c=w);
true
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> e := ErrorVector(Random([1..WordLength(C)]), C);;
gap> j := Decode(C,c+e);;
gap> (i=j);
true
gap> w := Decodeword(C,c+e);;
gap> (c=w);
true
gap> e := ErrorVector(Random(Combinations([1..WordLength(C)],2)), C);;
gap> j := Decode(C,c+e);;
gap> (i=j);
true
gap> w := Decodeword(C,c+e);;
gap> (c=w);
true
gap> C := BCHCode( 15, 3, 5, GF(2) ); #Not narrow sense
a cyclic [15,5,7]5 BCH code, delta=7, b=1 over GF(2)
gap> HasSpecialDecoder(C);
true
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> j := Decode(C,c);;
gap> (i=j);
true
gap> w := Decodeword(C,c);;
gap> (c=w);
true
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> e := ErrorVector(Random([1..WordLength(C)]), C);;
gap> j := Decode(C,c+e);;
gap> (i=j);
true
gap> w := Decodeword(C,c+e);;
gap> (c=w);
true
gap> e := ErrorVector(Random(Combinations([1..WordLength(C)],2)), C);;
gap> j := Decode(C,c+e);;
gap> (i=j);
true
gap> w := Decodeword(C,c+e);;
gap> (c=w);
true
gap> e := ErrorVector(Random(Combinations([1..WordLength(C)],3)), C);;
gap> j := Decode(C,c+e);;
gap> (i=j);
true
gap> w := Decodeword(C,c+e);;
gap> (c=w);
true
gap> C := BCHCode( 23, 5, GF(2) );
a cyclic [23,12,5..7]3 BCH code, delta=5, b=1 over GF(2)
gap> HasSpecialDecoder(C);
true
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> j := Decode(C,c);;
gap> (i=j);
true
gap> w := Decodeword(C,c);;
gap> (c=w);
true
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> e := ErrorVector(Random([1..WordLength(C)]), C);;
gap> j := Decode(C,c+e);;
gap> (i=j);
true
gap> w := Decodeword(C,c+e);;
gap> (c=w);
true
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> e := ErrorVector(Random(Combinations([1..WordLength(C)],2)), C);;
gap> j := Decode(C,c+e);;
gap> (i=j);
true
gap> w := Decodeword(C,c+e);;
gap> (c=w);
true
gap> C := BCHCode(26,5,GF(3));
a cyclic [26,17,5..6]3..6 BCH code, delta=5, b=1 over GF(3)
gap> HasSpecialDecoder(C);
true
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> j := Decode(C,c);;
gap> (i=j);
true
gap> w := Decodeword(C,c);;
gap> (c=w);
true
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> e := ErrorVector(Random([1..WordLength(C)]), C);;
gap> j := Decode(C,c+e);;
gap> (i=j);
true
gap> w := Decodeword(C,c+e);;
gap> (c=w);
true
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> e := ErrorVector(Random(Combinations([1..WordLength(C)],2)), C);;
gap> j := Decode(C,c+e);;
gap> (i=j);
true
gap> w := Decodeword(C,c+e);;
gap> (c=w);
true

#these test fail (randomly) because of a known bug in cyclic
#code decoding
#gap> x:= Indeterminate( GF(2) );; P:= x^3+x^2+1;;
#gap> C := GeneratorPolCode(P, 7, GF(2));
#a cyclic [7,4,1..3]1 code defined by generator polynomial over GF(2)
#gap> HasSpecialDecoder(C);
#true
#gap> c := Random(C);;
#gap> i := InformationWord(C, c);;
#gap> j := Decode(C,c);;
#gap> (i=j);
#true
#gap> w := Decodeword(C,c);;
#gap> (c=w);
#true
#gap> c := Random(C);
#gap> i := InformationWord(C, c);
#gap> e := ErrorVector(Random([1..WordLength(C)]), C);
#gap> j := Decode(C,c+e);
#gap> (i=j);
#true
#gap> w := Decodeword(C,c+e);;
#gap> (c=w);
#true
gap> x:= Indeterminate( GF(5) );; P:=x^8+x^7-x^5+Z(5)*x^3+Z(5)*x-1;;
gap> C := GeneratorPolCode(P, 24, GF(5));
a cyclic [24,16,1..6]4..8 code defined by generator polynomial over GF(5)
gap> HasSpecialDecoder(C);
true
gap> c := Random(C);;
gap> i := InformationWord(C, c);;
gap> j := Decode(C,c);;
gap> (i=j);
true
gap> w := Decodeword(C,c);;
gap> (c=w);
true

Quelle decoding.tst Sprache: unbekannt

[ Dauer der Verarbeitung: 0.19 Sekunden (vorverarbeitet) ]