On the second greedy weight for linear codes satisfying the fullrank condition (Q2583102)

Let \(C\) be a \([n,k,d]_q\) linear code with weight hierarchy \((d_1,d_2,\ldots,d_k)\). Assume that the Ozarov-Wyner scheme is being used. Denote by \(g_r\) the minimal number of symbols an adversary has to read in order to get \(r\) \(q\)-ary symbols of information. The sequence \((g_1,g_2,\ldots,g_k)\) is called the greedy weight hierarchy of \(C\). The authors consider the problem of maximazing the value of \(g_2-d_2\). They investigate the problem for \(k=3\) and general \(q\). They prove upper bounds on \(g_2-d_2\) for codes satisfying the fullrank condition. Under some additional conditions, they obtain codes for which \(g_2-d_2\) meets the upper bound.