A Hierarchical-based Greedy Algorithm for Echelon-Ferrers Construction

11/04/2019

∙

by   Xianmang He, et al.

∙

0

∙

share

Echelon-Ferrers is one of important techniques to help researchers to improve lower bounds for subspace code. Unfortunately, exact computation of echelon ferrers construction is limited by the computation time. In this paper, we show how to attain codes of larger size for a given minimum distance d=4 or 6 by the hierarchical-based greedy algorithm for echelon-ferrers introduced in [6]. About 63 new constant-dimension subspace codes are better than previously best known codes.