On the second greedy weight for linear codes satisfying the fullrank condition
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.
- scientific article; zbMATH DE number 1504658
- On the Second Greedy Weight for Linear Codes of Dimension at Least>tex<$4$>/tex<
- On the second greedy weight for linear codes of dimension 3
- On the Second Relative Greedy Weight of 4-Dimensional Codes
- Further results on the second relative greedy weight of 3-dimensional codes
- The complete weight distributions of two classes of linear codes
- Weight hierarchies of linear codes satisfying the almost chain condition
- On the second weight of generalized Reed-Muller codes
- Weight hierarchies of linear codes satisfying the near-chain condition
- Forcing linearity on greedy codes
- Further results on the second relative greedy weight of 3-dimensional codes
- On the third greedy weight of 4-dimensional codes
- On the Second Greedy Weight for Linear Codes of Dimension at Least>tex<$4$>/tex<
- scientific article; zbMATH DE number 1504658 (Why is no real title available?)
- On the second relative greedy weight
- On the second greedy weight for linear codes of dimension 3
This page was built for publication: On the second greedy weight for linear codes satisfying the fullrank condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583102)
