Projection-forcing multisets of weight changes
From MaRDI portal
Abstract: Let be a finite field. A multiset of integers is projection-forcing if for every linear function whose multiset of weight changes is , is a coordinate projection up to permutation and scaling of entries. The MacWilliams Extension Theorem from coding theory says that is projection-forcing. We give a (super-polynomial) algorithm to determine whether or not a given is projection-forcing. We also give a condition that can be checked in polynomial time that implies that is projection-forcing. This result is a generalization of the MacWilliams Extension Theorem and work by the first author.
Recommendations
- Extremal weight projectors
- Weighted projections into closed subspaces
- A characterization of a multiple weights class
- scientific article; zbMATH DE number 1150277
- Multi-way set enumeration in weight tensors
- Projection weighted symmetric discrepancy
- scientific article; zbMATH DE number 4165643
- A method for weighted projections to the positive definite cone
- A multivariate framework for weighted FPT algorithms
Cites work
This page was built for publication: Projection-forcing multisets of weight changes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1957968)