Group Partition, Factorization and the Vector Covering Problem
From MaRDI portal
Publication:5672649
DOI10.4153/CMB-1972-038-xzbMath0258.05028OpenAlexW2314746196MaRDI QIDQ5672649
Publication date: 1972
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cmb-1972-038-x
Related Items
Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces ⋮ Maximal partial spreads and two-weight codes ⋮ New results for covering systems of residue sets ⋮ A SURVEY OF THE DIFFERENT TYPES OF VECTOR SPACE PARTITIONS ⋮ A covering problem over finite rings ⋮ Partitions of finite Abelian groups ⋮ The maximum size of a partial spread in a finite projective space ⋮ On the type(s) of minimum size subspace partitions ⋮ The lattice of finite subspace partitions ⋮ Partitions of a vector space ⋮ Partitions linéaires arguesiennes d'un espace vectoriel ⋮ The Exhaustion Numbers of the Generalized Quaternion Groups ⋮ Extremal sizes of subspace partitions ⋮ Inhomogeneous quantum codes. III: The asymmetric case ⋮ The structure of the minimum size supertail of a subspace partition ⋮ Sharp covering of a module by cyclic submodules ⋮ The maximum size of a partial spread. II: Upper bounds ⋮ The complete characterization of the minimum size supertail in a subspace partition ⋮ Heden's bound on the tail of a vector space partition ⋮ Finite Coverings by Cosets of Normal Subgroups ⋮ On the non-existence of certain perfect mixed codes ⋮ 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 ⋮ Partitions of $Z_2^n $
