perldl> $b = pdl [[0,0,0],[0,0,1],[0,1,0],[0,1,1],[1,0,0],[1,0,1],[1,1,0],[1,1,1]];
perldl> p $b

[
 [0 0 0]
 [0 0 1]
 [0 1 0]
 [0 1 1]
 [1 0 0]
 [1 0 1]
 [1 1 0]
 [1 1 1]
]
perldl> $a = pdl [[1,0,0,1,0],[0,1,0,1,1],[0,0,1,0,1]];

perldl> p $a

[
 [1 0 0 1 0]
 [0 1 0 1 1]
 [0 0 1 0 1]
]
perldl> $c = $b x $a;

perldl> p $c

[
 [0 0 0 0 0]
 [0 0 1 0 1]
 [0 1 0 1 1]
 [0 1 1 1 2]
 [1 0 0 1 0]
 [1 0 1 1 1]
 [1 1 0 2 1]
 [1 1 1 2 2]
]


perldl> $c = $c % 2;

perldl> p $c

[
 [0 0 0 0 0]
 [0 0 1 0 1]
 [0 1 0 1 1]
 [0 1 1 1 0]
 [1 0 0 1 0]
 [1 0 1 1 1]
 [1 1 0 0 1]
 [1 1 1 0 0]
]

Ratio del código: k/m = 3/5 = 0.6

Distancia mínima de Hamming: 

for($i=0;$i<$d->getdim(1);$i++) { for ($j=0;$j<$d->getdim(1);$j++) { if ($i != $j) { $tmp = $d(,$j) ^ $d(,$i); if(   $tmp->sumover != 0 && $tmp->sumover < $sum ) {$sum=$tmp->sumover}; p $tmp,$sum,$d(,$j),$d(,$i);}}}


perldl> $d = pdl [[1,1,0,1,0],[0,1,1,0,1]]

perldl> p $d

[
 [1 1 0 1 0]
 [0 1 1 0 1]
]

perldl> $Ht = $d->xchg(0,1);

perldl> p $Ht

[
 [1 0]
 [1 1]
 [0 1]
 [1 0]
 [0 1]
]

perldl> $s = $c x $Ht;
perldl> p $s

[
 [0 0]
 [2 2]
 [2 2]
 [2 2]
 [2 0]
 [2 2]
 [2 2]
 [2 2]
]
perldl> p $s % 2

[
 [0 0]
 [0 0]
 [0 0]
 [0 0]
 [0 0]
 [0 0]
 [0 0]
 [0 0]
]

Evidentemente las palabras código tienen síndrome 0