On the second greedy weight for binary linear codes
From MaRDI portal
Recommendations
- 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 greedy weight for linear codes satisfying the fullrank condition
- On the third greedy weight of 4-dimensional codes
- On two-weight codes
Cited in
(13)- Antichain codes
- Forcing linearity on greedy codes
- Further results on the second relative greedy weight of 3-dimensional codes
- Value functions and two classes of binary 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<
- On the second relative greedy weight
- Coding and Cryptography
- On the second greedy weight for linear codes of dimension 3
- On the most weight w vectors in a dimension k binary code
- Integer sequences that are generalized weights of a linear code
This page was built for publication: On the second greedy weight for binary linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4502620)