Group Partition, Factorization and the Vector Covering Problem
From MaRDI portal
Cited in
(26)- Necessary and sufficient conditions for the existence of a class of partitions of a finite vector space
- On rank and kernel of some mixed perfect codes
- On the length of the tail of a vector space partition
- Maximal partial spreads and two-weight codes
- Partitions of finite Abelian groups
- Partitions of a vector space
- Partitions linéaires arguesiennes d'un espace vectoriel
- Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces
- The complete characterization of the minimum size supertail in a subspace partition
- Heden's bound on the tail of a vector space partition
- Sharp covering of a module by cyclic submodules
- The maximum size of a partial spread in a finite projective space
- Inhomogeneous quantum codes. III: The asymmetric case
- A survey of the different types of vector space partitions
- Finite Coverings by Cosets of Normal Subgroups
- Partitions of Z₂ⁿ
- New results for covering systems of residue sets
- On the type(s) of minimum size subspace partitions
- The lattice of finite subspace partitions
- Extremal sizes of subspace partitions
- The structure of the minimum size supertail of a subspace partition
- The maximum size of a partial spread. II: Upper bounds
- The Exhaustion Numbers of the Generalized Quaternion Groups
- The second minimum size of a finite subspace partition
- On the non-existence of certain perfect mixed codes
- A covering problem over finite rings
This page was built for publication: Group Partition, Factorization and the Vector Covering Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5672649)
