Abstract: Finding the minimum distance of linear codes is in general a NP-hard problem, we propose an efficient algorithm to attack this problem. The principle of this approach is to search code words ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback