Oct 7, 2021 · Abstract. We study subspace codes with nonmaximum code distance. As opposed to spreads, i.e., codes with the maximum subspace distance, we refer ...
Jul 1, 2021 · Abstract. We study subspace codes with nonmaximum code distance. As opposed to spreads, i.e., codes with the maximum subspace distance, we refer ...
A code with maximum distance dsub = 2m is called a spread. We will refer to subspace codes with distances other than the maximum as nonspreads. Deceased. shows ...
New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes · Multicomponent codes with maximum code distance · Optimal binary subspace codes of length ...
We study subspace codes with nonmaximum code distance. As opposed to spreads, i.e., codes with the maximum subspace distance, we refer to them as nonspreads ...
Apr 11, 2023 · Plotkin bound seems to give something for S which is a linear code (also it applies only for restricted ranges of distance, not generically for ...
Missing: Non- maximum
... not a constant ... The maximum possible cardinality of a subspace code ... Codes attaining this upper bound are called maximum rank distance (MRD) codes.
This paper is devoted to multicomponent subspace codes with zero prefix (MZP). The construction is described. The codes are divided into two parts.
Missing: Non- | Show results with:Non-
Aug 5, 2014 · A subspace code is denoted by (n, M, d) q, if the size of codewords is M and the minimum distance of is d. Furthermore, if , is denoted by (n, ...
Jan 1, 2023 · , strongly based on the maximum number of subspaces that different flags in a flag code of type t and distance d can share. The paper is ...