Abstract: The first linear programming bound is the best known asymptotic upper bound for binary codes, for a certain subrange of distances. Starting from the work of Friedman and Tillich (2005), ...
Abstract: This article presents a prediction-correction proximal method (PCPM) for the general nonsmooth convex optimization problem with linear equality and inequality constraints. The proposed ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results