Support weight distribution of linear codes
Discrete Mathematics - A collection of contributions in honour of Jack van Lint
On the second greedy weight for linear codes of dimension 3
Discrete Mathematics
Designs, Codes and Cryptography
On the Second Greedy Weight for Binary Linear Codes
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Geometric approach to higher weights
IEEE Transactions on Information Theory - Part 1
The weight hierarchies of q-ary codes of dimension 4
IEEE Transactions on Information Theory - Part 2
The weight hierarchy of product codes
IEEE Transactions on Information Theory
A Lower Bound on the Greedy Weights of Product Codes
Designs, Codes and Cryptography
| Hi-index | 0.00 |
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of a generator matrix as projective points. Projective multisets have provedv ery powerful in the study of generalised Hamming weights. In this paper we study relations between a code and its dual.