Oct 7, 2021 · We study subspace codes with nonmaximum code distance. As opposed to spreads, ie, codes with the maximum subspace distance, we refer to them as nonspreads here.
Jul 1, 2021 · We study subspace codes with nonmaximum code distance. As opposed to spreads, ie, codes with the maximum subspace distance, we refer to them as nonspreads here.
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.
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 · What is the largest |S| such that for every x,y∈S, we have that d(x,y)≥n⋅δ (for arbitrary ranges of α), where d(x,y)=∑i[xi≠yi]. Plotkin bound ...
Missing: Non- maximum
The maximum possible cardinality of a subspace code in 𝔽 q n superscript ... Codes attaining this upper bound are called maximum rank distance (MRD) codes.
The codes are divided into two parts. The first part contains the codes which code distance is not maximal. The second part contains of the codes with maximal ...
Missing: Non- | Show results with:Non-
The maximum cardinality of a code of length n over an alphabet of size q and with s distinct distances is considered. Generalizing Delsarte's method ...
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, ...
The maximum cardinality N of an ( n , N , d ; K ) q subspace code is denoted as A q ( n , d ; K ) and the simpler notation A q ( n , d ; k ) in the constant- ...