On the second relative greedy weight
From MaRDI portal
Publication:505069
DOI10.1007/S12095-015-0168-ZzbMATH Open1362.94063OpenAlexW2297265777MaRDI QIDQ505069FDOQ505069
Publication date: 19 January 2017
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-015-0168-z
Recommendations
- scientific article; zbMATH DE number 1504658
- Second-best probability weighting
- Second-Order Weight Distributions
- Weight-almost greedy bases
- On the Second Relative Greedy Weight of 4-Dimensional Codes
- The weighted property (A) and the greedy algorithm
- On the second greedy weight for linear codes satisfying the fullrank condition
- Greedy weights for matroids
- On weighted greedy-type bases
- A new weighted metric: the relative metric. II
Cites Work
- Generalized Hamming weights for linear codes
- Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes
- Some New Characters on the Wire-Tap Channel of Type II
- Antichain codes
- On the Second Greedy Weight for Linear Codes of Dimension at Least>tex<$4$>/tex<
- The relative generalized Hamming weight of linear \(q\)-ary codes and their subcodes
- On the second greedy weight for linear codes of dimension 3
Cited In (6)
- Greedy weights for matroids
- Flags of almost affine codes and the two-party wire-TAP channel of type II
- On relative constant-weight 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 3
This page was built for publication: On the second relative greedy weight
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505069)
