Answers are grounded in this paper and cite their sources.
Suppose that A1 and A2 are two linear codes over Fm with parameters [n,k] and [n,k′], respectively. For the code A={(x,x+y):x∈A1,y∈A2}, we asked about dr(A) in terms of dr(A1) and dr(A2), so we obtained an upper bound for dr(A) in terms of them. In addition, we obtained d2(A) in which A1 and A2 are codes over F2. Additionally, we obtained d2(A) in non-binary case, where it is different of what we have for binary case. Suppose that M is a linear code over a finite field. The minimum of the support sizes among r-dimensional sub-codes of M is called the r-th generalized Hamming weight of M that we will denote it by dr(M).
No takes yet. Share an insight, caveat, or question.
Farzaneh Farhang Baftani (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: