- Full text PDF available (6)
- This year (3)
- Last 5 years (6)
- Last 10 years (7)
Journals and Conferences
We define generalized Hamming weights for almost affine codes. We show that this definition is natural, since we can extend some well-known properties of the generalized Hamming weights for linear codes, to almost affine codes. In addition, we discuss the duality of almost affine codes, and of the smaller class of multilinear codes.
The theorem of Jung establishes a relation between circumradius and diameter of a convex body. The half of the diameter can be interpreted as the maximum of circumradii of all 1-dimensional sections or 1-dimensional orthogonal projections of a convex body. This point of view leads to two series of j-dimensional circumradii, defined via sections or… (More)
Generalizing polynomials previously studied in the context of linear codes, we define weight polynomials and an enumerator for a matroid M . Our main result is that these polynomials are determined by Betti numbers associated with N0-graded minimal free resolutions of the Stanley-Reisner ideals of M and so-called elongations of M . Generalizing Greene’s… (More)
We describe a two-party wire-tap channel of type II in the framework of almost affine codes. Its cryptological performance is related to some relative profiles of a pair of almost affine codes. These profiles are analogues of relative generalized Hamming weights in the linear case.
Given a constant weight linear code, we investigate its weight hierarchy and the Stanley-Reisner resolution of its associated matroid regarded as a simplicial complex. We also exhibit conditions on the higher weights sufficient to conclude that the code is of constant weight.
To each linear code $$C$$ over a finite field we associate the matroid $$M(C)$$ of its parity check matrix. For any matroid $$M$$ one can define its generalized Hamming weights, and if a matroid is associated to such a parity check matrix, and thus of type $$M(C)$$ , these weights are the same as those of the code $$C$$ . In our main result we show how the… (More)