Year: 2024
Type: article
Abstract: Finding the highest possible cardinality, Aq(n,d;k), of the set of k-dimensional subspaces in Fqn, also known as codewords, is a fundamental problem in constant dimension codes (CDCs). CDCs find applications in a number of domains, including distributed storage, cryptography, and random linear network coding. The goal of recent research papers has been to establish Aq(n,d;k). We further improved the echelon-Ferrers construction with an algorithm, and enhanced the inserting construction by swapping specified columns of the generator matrix to obtain new lower bounds.
Source: Mathematics
DOI: 10.3390/math12203270
Authors: Yongfeng Niu, Xuan Wang
Institution: Changzhou University
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $2,955
Awards: G3344333907, G4598745317, G8492084559
OpenAlex ID: W4403603099