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 ...

Analyze the time and space complexity of your solution. Compare your solution to others and identify areas for improvement.

Linear Trees combine the learning ability of Decision Tree with the predictive and explicative power of Linear Models. Like in tree-based algorithms, the data are split according to simple decision ...

Abstract: 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.

Source Code for HappyCoders.eu article series on tree data structures (binary tree, binary search tree, AVL tree, red-black tree).