zbMATH — the first resource for mathematics

A general product construction for error correcting codes. (English) Zbl 0546.94015
In this paper the author presents a generalized product construction for binary error correcting codes in the Hamming-metric and then the author uses it to establish lower bounds on the number of nonisomorphic and nonequivalent perfect single error correcting codes, e.g. the number of nonequivalent perfect single error correcting codes of length n is at least \(2^{2^{cn}}\), for some constant \(c<1\).
Reviewer: K.Lindström

94B25 Combinatorial codes
05B40 Combinatorial aspects of packing and covering
Full Text: DOI
[1] Bush, K. A., Orthogonal arrays of index unity, Ann. Math. Statistics, 23, 426, (1952) · Zbl 0047.01704
[2] Bush, K. A., A generalization of a theorem due to macneish, Ann. Math. Statistics, 23, 293, (1952) · Zbl 0047.01702
[3] Denes, J.; Keedwell, A., Latin squares and their applications, 547, (1974) · Zbl 0283.05014
[4] MacWilliams, F. J.; Sloane, N. J. A., The Theory of Error Correcting Codes, (1978) · Zbl 0369.94008
[5] Phelps, K. T., A combinatorial construction of perfect codes, SIAM J. Algebraic Discrete Methods, 4, 398, (1983) · Zbl 0549.94029
[6] Phelps, K. T., Direct product of derived Steiner systems using inversive planes, Canad. J. Math., 33, 1365, (1981) · Zbl 0429.05017
[7] Raghavarao, Damaraju, Constructions and combinatorial problems in design of experiments, (1971) · Zbl 0222.62036
[8] Sloane, NeilJ. A.; Whitehead, DonaldS., New family of single-error correcting codes, IEEE Trans. Information Theory, IT-16, 717, (1970) · Zbl 0206.21201
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.