Notes on the value function

DOI10.1007/S10623-009-9305-ZMaRDI QIDQ849349zbMATH OpenOpenAlexFDO

Authors Wende Chen, Zihui Liu

Publication date 25 February 2010

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-009-9305-z

zbMATH Keywords

finite projective geometrygeneralized Hamming weightrelative generalized Hamming weightvalue function

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Review text

The purpose of this paper is to show some important properties of the value function, and then apply them to linear codes. In fact, the value function was first introduced by \textit{W. Chen} and \textit{T. Kløve} [IEEE Trans. Inf. Theory 42, No. 6, Pt. 2, 2265--2272 (1996; Zbl 0872.94044)], and it was used to construct the generator matrix of a linear code so as to determine the generalized Hamming weight. The relative generalized Hamming weight was first introduced in 2005 by Luo, Chaichana, Han Vinck and Chen [\textit{Y. Luo}, IEEE Trans. Inf. Theory 51, No. 3, 1222--1229 (2005; Zbl 1297.94035)]. The value function can also be generalized to study the relative generalized Hamming weight of a linear code and its subcodes.

Recommendations

• Weight functions and generalized Hamming weights of linear codes
• Further results on support weights of certain subcodes
• The fullrank value function
• Generalized Hamming weights for linear codes
• Value functions and two classes of binary codes

Cites work

• Generalized Hamming weights for linear codes
• Some New Characters on the Wire-Tap Channel of Type II
• The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes
• The weight hierarchies of q-ary codes of dimension 4

Cited in

(13)

• A value function that explains the magnitude and sign effects
• Pure resolutions, linear codes, and Betti numbers
• Relative one-weight linear codes
• Stanley-Reisner resolution of constant weight linear codes
• On relative constant-weight codes
• Trellis complexity and pseudoredundancy of relative two-weight codes
• The geometric structure of relative one-weight codes
• On a kind of two-weight code
• The \(t\)-wise intersection of relative two-weight codes
• New results on the pseudoredundancy
• A property of the relative subcodes
• Further results on support weights of certain subcodes
• A geometric approach to rank metric codes and a classification of constant weight codes

This page was built for publication: Notes on the value function

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