All in all, using [1]} (one of the most advanced ISD techniques)
to compute low weight codewords of some shape we are able to outperform significantly even the latest improvements of ISD algorithms for code rates \(R\)  smaller than \(0.3\)  as shown in Figure REF . This is a breakthrough in this area, given the dominant role that ISD algorithms have played during all those years for assessing the complexity of decoding a linear code.
<FIGURE>