AI Chat AI Image Generator AI Video Text to Speech

New LMRD bounds for constant dimension codes and improved constructions

01/15/2018

∙

by Daniel Heinlein, et al.

∙

∙

We generalize upper bounds for constant dimension codes containing a lifted maximum rank distance code first studied by Etzion and Silberstein. The proof allows to construct several improved codes.

page 1

page 2

page 3

page 4

research

∙ 09/15/2021

The interplay of different metrics for the construction of constant dimension codes

A basic problem for constant dimension codes is to determine the maximum...

0 Sascha Kurz, et al. ∙

research

∙ 06/25/2021

Doubly-Exponential Identification via Channels: Code Constructions and Bounds

Consider the identification (ID) via channels problem, where a receiver ...

0 Onur Günlü, et al. ∙

research

∙ 11/25/2021

On the dimension and structure of the square of the dual of a Goppa code

The Goppa Code Distinguishing (GD) problem asks to distinguish efficient...

0 Rocco Mora, et al. ∙

research

∙ 05/17/2023

New and improved bounds on the contextuality degree of multi-qubit configurations

We present algorithms and a C code to decide quantum contextuality and e...

0 Axel Muller, et al. ∙

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/01/2021

Flag codes of maximum distance and constructions using Singer groups

In this paper we study flag codes of maximum distance. We characterize t...

0 Miguel Ángel Navarro-Pérez, et al. ∙

research

∙ 05/04/2022

Improved error bounds for the distance distribution of Reed-Solomon codes

We use the generating function approach to derive simple expressions for...

0 Zhicheng Gao, et al. ∙