New constructions of constant dimension codes by improved inserting construction

Minyao Niu, Jinghua Xiao and You Gao

Applied Mathematics and Computation, 2023, vol. 446, issue C

Abstract: Let C be a constant dimension code whose codewords are k-dimensional subspaces of Fqm. One of the main research problems of constant dimension codes is to calculate the maximum possible cardinality Aq(m,d,k) of the code whose the distance between any two different codewords is at least d. In this paper, we propose a new construction approach of constant dimension codes. The constant dimension codes based on this construction can be inserted into the parallel linkage construction. Moreover, the proposed construction gives new lower bounds of Aq(m,d,k) for m=2k. Some constant dimension codes with larger cardinality than the previously best known codes are given.

Keywords: Constant dimension codes; Rank metric codes; Parallel linkage construction; Inserting construction (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323000541
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:446:y:2023:i:c:s0096300323000541

DOI: 10.1016/j.amc.2023.127885

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().