On the second greedy weight for linear codes of dimension 3

DOI10.1016/S0012-365X(01)00116-9MaRDI QIDQ5951935zbMATH OpenWikidataFDO

Authors Wende Chen, Torleiv Kløve

Publication date 8 October 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(01)00116-9

zbMATH Keywords

linear codessecond greedy weightweightings of the points in the projective plane

Mathematics Subject Classification ID

Finite affine and projective planes (geometric aspects) (51E15) Cryptography (94A60) Linear codes (general theory) (94B05)

Review text

The authors study the difference \(g_2- d_2\) for a \(q\)-ary linear \([n,3,d]\) code \(C\). Here \(g_2\) is the second greedy weight (= the smallest size of the support of a 2-dimensional subcode of \(C\) that contains a codeword of weight \(d\)) and \(d_2\) is the second generalized Hamming weight (= the smallest size of the support of a 2-dimensional subcode of \(C\)). The extra cost to a greedy adversary (in positions read) to get two symbols of information using a certain algorithm is \(g_2- d_2\). The authors show for codes of dimension 3 that the problem is essentially equivalent to finding certain weightings of the points in the projective plane, and weightings that give the maximal value of \(g_2-d_2\) are determined in almost all cases. In particular, the maximal value of \(g_2- d_2\) is determined in all cases for \(q\leq 9\).

Recommendations

• On the second greedy weight for linear codes satisfying the fullrank condition
• On the Second Greedy Weight for Linear Codes of Dimension at Least>tex<$4$>/tex<
• scientific article; zbMATH DE number 1504658
• On the second relative greedy weight
• On the third greedy weight of 4-dimensional codes

Cited in

(7)

• Further results on the second relative greedy weight of 3-dimensional codes
• Greedy weights for matroids
• On the third greedy weight of 4-dimensional codes
• On the second greedy weight for linear codes satisfying the fullrank condition
• 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

This page was built for publication: On the second greedy weight for linear codes of dimension 3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951935)