AI Chat AI Image Generator AI Video Text to Speech

A Note on Echelon-Ferrers Construction

02/24/2020

∙

by Xianmang He, et al.

∙

∙

Echelon-Ferrers is one of important techniques to help researchers to improve lower bounds for constant-dimension codes. Fagang Li [6] combined the linkage construction and echelon-Ferrers to obtain some new lower bounds of constant-dimension codes. However, this method seems incorrect since we found a counterexample.

Xianmang He
5 publications
Yindong Chen
3 publications

page 1

page 2

page 3

page 4

research

∙ 11/01/2019

Construction of Const Dimension Codes from Serval Parallel Lift MRD Code

In this paper, we generalize the method of using two parallel versions o...

0 Xianmang He, et al. ∙

research

∙ 11/04/2019

A Hierarchical-based Greedy Algorithm for Echelon-Ferrers Construction

Echelon-Ferrers is one of important techniques to help researchers to im...

0 Xianmang He, et al. ∙

research

∙ 06/24/2019

A note on the linkage construction for constant dimension codes

Constant dimension codes are used for error control in random linear net...

0 Sascha Kurz, et al. ∙

research

∙ 08/18/2021

Improved Lower Bounds for Secure Codes and Related Structures

Secure codes are widely-studied combinatorial structures which were intr...

0 Bingchen Qian, et al. ∙

research

∙ 07/05/2019

Subspaces intersecting in at most a point

We improve on the lower bound of the maximum number of planes in PG(8,q)...

0 Sascha Kurz, et al. ∙

research

∙ 11/18/2019

Comments on the Du-Kakade-Wang-Yang Lower Bounds

Du, Kakade, Wang, and Yang recently established intriguing lower bounds ...

0 Benjamin Van Roy, et al. ∙

research

∙ 01/26/2023

A Bound for Stieltjes Constants

The goal of this note is to improve on the currently available bounds fo...

0 Sebastian Pauli, et al. ∙