A note on reducing the computation time for minimum distance and equivalence check of binary linear codes
Information Theory
2018-09-12 v1 math.IT
Abstract
In this paper we show the usability of the Gray code with constant weight words for computing linear combinations of codewords. This can lead to a big improvement of the computation time for finding the minimum distance of a code. We have also considered the usefulness of combinatorial - designs when there are memory limitations to the number of objects (linear codes in particular) that can be tested for equivalence.
Cite
@article{arxiv.1809.03764,
title = {A note on reducing the computation time for minimum distance and equivalence check of binary linear codes},
author = {Nikolay Yankov and Krassimir Enev},
journal= {arXiv preprint arXiv:1809.03764},
year = {2018}
}