Group Partitions and Mixed Perfect Codes
Canadian mathematical bulletin, Tome 18 (1975) no. 1, pp. 57-60
Voir la notice de l'article provenant de la source Cambridge University Press
Let G be a finite abelian group of the order p r and type (p, ..., p), where p is a prime. A necessary and sufficient condition is determined for the existence of subgroups G1, G2, ⋯, Gn, one of the order pa and the rest of the order pb , such that G = G1 ∪ G2 ∪ ⋯ ∪ Gn and Gi, ∩ Gj,= {θ} when i ≠ j.
Lindström, Bernt. Group Partitions and Mixed Perfect Codes. Canadian mathematical bulletin, Tome 18 (1975) no. 1, pp. 57-60. doi: 10.4153/CMB-1975-011-2
@article{10_4153_CMB_1975_011_2,
author = {Lindstr\"om, Bernt},
title = {Group {Partitions} and {Mixed} {Perfect} {Codes}},
journal = {Canadian mathematical bulletin},
pages = {57--60},
year = {1975},
volume = {18},
number = {1},
doi = {10.4153/CMB-1975-011-2},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1975-011-2/}
}
[1] 1. Herzog, M. and Schönheim, J., Linear and nonlinear single-error-correcting perfect mixed codes, Information and Control 18 (1971), 364-368. Google Scholar
[2] 2. Herzog, M. and Schönheim, J., Group partition, factorization and the vector covering problem, Canad. Math. Bull. 15 (2) (1972), 207-214. Google Scholar
[3] 3. Lenstra, H. W. Jr., Two theorems on perfect codes, Discrete mathematics 3 (1972), 125-132. Google Scholar
Cité par Sources :