AI Chat AI Image Generator AI Video Text to Speech

Construction of Const Dimension Code from Two Parallel Versions of Linkage Construction

10/10/2019

∙

by Xianmang He, et al.

∙

∙

According the report [10], the lower bound with the highest score is the improved linkage construction, and it produce currently the best known lower bound about 69.1% of the constant dimension code. We show how to improve the linkage construction of subspace codes by two parallel versions of linkage construction. This proof allow us to attain codes of larger size for a given minimum distance.

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

∙ 09/12/2022

An Improved Lower Bound for Matroid Intersection Prophet Inequalities

We consider prophet inequalities subject to feasibility constraints that...

0 Raghuvansh R. Saxena, 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

∙ 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

∙ 02/03/2023

Improving the dimension bound of Hermitian Lifted Codes

In this article we improve the dimension and minimum distance bound of t...

0 Austin Allen, et al. ∙

research

∙ 01/16/2020

On the decoding of Barnes-Wall lattices

We present new efficient recursive decoders for the Barnes-Wall lattices...

0 Vincent Corlay, et al. ∙

research

∙ 07/09/2023

Derandomizing Codes for the Binary Adversarial Wiretap Channel of Type II

We revisit the binary adversarial wiretap channel (AWTC) of type II in w...

0 Eric Ruzomberka, et al. ∙