The weight hierarchies of q-ary codes of dimension 4
From MaRDI portal
Publication:4336416
DOI10.1109/18.556621zbMATH Open0872.94044OpenAlexW2105935503MaRDI QIDQ4336416FDOQ4336416
Authors: Wende Chen, Torleiv Kløve 
Publication date: 12 May 1997
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.556621
Recommendations
Cited In (38)
- Trellis complexity and pseudoredundancy of relative two-weight codes
- On a kind of two-weight code
- A property of the relative subcodes
- Minimum support weights of binary codes
- The relative generalized Hamming weight and the semilinear equivalence of codes
- Value functions and two classes of binary codes
- Notes on the value function
- Bounds on the weight hierarchies of linear codes of dimension 4
- On the equivalence of linear codes
- Finite projective geometries and classification of the weight hierarchies of codes. I
- New code equivalence based on relative generalized Hamming weights
- Fourth moments of the code-weights
- The fullrank value function
- The weight hierarchies of \(q\)-ary linear codes of dimension 4
- Further results on support weights of certain subcodes
- Weight hierarchies of linear codes of dimension 3
- Weight hierarchies of binary linear codes of dimension 4
- The geometric structure of relative one-weight codes
- On the intersection of binary linear codes
- The \(t\)-wise intersection and trellis of relative four-weight codes
- On relative constant-weight codes
- The weight hierarchy of Hadamard codes
- On the relative generalized Hamming weights of a 4-dimensional linear code and a subcode with dimension one
- The \(t\)-wise intersection of relative two-weight codes
- Further results on the second relative greedy weight of 3-dimensional codes
- New results on the pseudoredundancy
- Minimal codewords: an application of relative four-weight codes
- Relative one-weight linear codes
- On the third greedy weight of 4-dimensional codes
- Weight hierarchies of ternary linear codes of dimension 4 satisfying the break-chain condition
- Higher weights of anticodes and the generalized Griesmer bound.
- Classification of weight hierarchies of \(q\)-ary linear codes of dimension \(k\)
- Two classes of ternary codes and their weight distributions
- On a class of weight hierarchies of ternary linear codes of dimension 4
- The separation of binary relative three-weight codes and its applications
- The determination on weight hierarchies of \(q\)-ary linear codes of dimension 5 in class IV
- On the weight hierarchy of Goethals codes over Z/sub 4/
- The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes
This page was built for publication: The weight hierarchies of q-ary codes of dimension 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336416)
