2015•International Journal of Foundations of Computer ScienceRequires access

A Note on Optimal Constant Dimension Codes

Qunying Liao, Juan Zhu

Abstract

In this paper, we study bounds for optimal constant dimension codes further. By revising the construction for constant dimension codes in [4], we improve some bounds on q-ary constant dimension codes in some cases. By combinatorial method, we show that there exists no optimal constant dimension code Aq[n, 2δ, k] meeting both Wang-Xing-Safavi-Naini-Bound and the maximal distance separate bound simultaneously.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Dimension (graph theory), Constant (computer programming), Mathematics, Upper and lower bounds, Combinatorics, Code (set theory), Discrete mathematics, Minimum distance