We give bounds for the minimal distance of duals of binary Bose-Chaudhuri-Hocquenghem (BCH) codes in a range where the Carlitz-Uchiyama bound is trivial. This is done by estimating the number of ...

To a programmer, code can seem a “domain of sorcery” in which strings of characters have power in the real world.

the complementary task runner for python. Contribute to taskipy/taskipy development by creating an ... $ poetry run task --list test runs all unit tests lint confirms code style using pylint ...

An efficient algorithm for classification of binary self-dual codes is presented. As an application, a complete classification of the self-dual codes of length 38 is given. Published in: IEEE ...

HiGHS is a high performance serial and parallel solver for large scale sparse linear optimization problems of the form $$ \min \quad \dfrac{1}{2}x^TQx + c^Tx \qquad \textrm{s.t.}~ \quad L \leq Ax \leq ...