Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-14T06:27:58.573Z Has data issue: false hasContentIssue false
  • English
  • Français

Group Partitions and Mixed Perfect Codes

Published online by Cambridge University Press:  20 November 2018

Bernt Lindström
Bernt Lindström*
Affiliation:
Department of Mathematics, University of Stockholm, Box 6701, S-113 85 Stockholm, SwedenEmaljvägen 14V S-175 73 Järfälla, Sweden
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 18 , Issue 1 , April 1975, pp. 57 - 60
Copyright
Copyright © Canadian Mathematical Society 1975

References

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. 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. Lenstra, H. W. Jr., Two theorems on perfect codes, Discrete mathematics 3 (1972), 125-132.Google Scholar