×

Remark on a result of Constantine. (English) Zbl 1384.05057

Summary: In this short note we construct codes of length \(4n\) with \(8n+8\) codewords and minimum distance \(2n-2\) whenever \(4n+4\) is the order of a Hadamard matrix. This generalises work of G. M. Constantine [ibid. 19, No. 3, 421–425 (2015; Zbl 1327.05105)] who obtained a similar result in the special case that \(n\) is a prime power.

MSC:

05B20 Combinatorial aspects of matrices (incidence, Hadamard, etc.)
94B25 Combinatorial codes
94C30 Applications of design theory to circuits and networks

Citations:

Zbl 1327.05105

References:

[1] Brauer A.: On a new class of Hadamard determinants. Math. Z 58, 219-225 (1953) · Zbl 0053.35802 · doi:10.1007/BF01174141
[2] Constantine G.M.: An alternative to Hadamard codes — one error the price for existence. Ann. Combin 19(3), 421-425 (2015) · Zbl 1327.05105 · doi:10.1007/s00026-015-0274-9
[3] Craigen R., Seberry J., Zhang X.M.: Product of four Hadamard matrices. J. Combin. Theory Ser. A 59(2), 318-320 (1992) · Zbl 0757.05032 · doi:10.1016/0097-3165(92)90073-4
[4] de Launey W., Flannery D.: Algebraic Design Theory Math. Surveys Monogr.Vol. 175. . American Mathematical Society, Providence: RI (2011) · Zbl 1235.05001
[5] de Launey W., Gordon D.M.: On the density of the set of known Hadamard orders. Cryptogr. Commun 2(2), 233-246 (2010) · Zbl 1198.94090 · doi:10.1007/s12095-010-0028-9
[6] Hadamard J.: Résolution d’une question relative aux déterminants. Bull. Sci. Math 17, 240-246 (1893) · JFM 25.0221.02
[7] Horadam K.J.: Hadamard Matrices and Their Applications. Princeton University Press, Princeton: NJ (2007) · Zbl 1145.05014 · doi:10.1515/9781400842902
[8] Kharaghani H., Tayfeh-Rezaie B.: On the classification of Hadamard matrices of order 32. J. Combin. Des. 18(5), 328-336 (2010) · Zbl 1209.05037 · doi:10.1002/jcd.20245
[9] McGuire G.: Quasi-symmetric designs and codes meeting the Grey-Rankin bound. J. Combin. Theory, Ser. A 78(2), 280-291 (1997) · Zbl 0873.05011 · doi:10.1006/jcta.1997.2765
[10] Paley R.: On orthogonal matrices. J. Math. Phys 12, 311-320 (1933) · Zbl 0007.10004 · doi:10.1002/sapm1933121311
[11] Peterson W.W., Weldon E.J. Jr.: Error-Correcting Codes Second Edition. The MIT Press, Cambridge (1972) · Zbl 0251.94007
[12] Seberry J., Yamada M.: On the products of Hadamard matrices, Williamson matrices and other orthogonal matrices using M-structures. J. Combin. Math. Combin. Comput 7, 97-137 (1990) · Zbl 0725.05026
[13] Seberry, J., Yamada, M.: Hadamard matrices, sequences, and block designs. In: Dinitz, J.H., Stinson, D.R. (eds.) Contemporary Design Theory, Wiley-Intersci. Ser. Discrete Math. Optim., pp. 431-560. Wiley, New York (1992) · Zbl 0776.05028
[14] Stanton R.G., Sprott D.A.: A family of difference sets. Canad. J. Math 10, 73-77 (1958) · Zbl 0079.01104 · doi:10.4153/CJM-1958-008-5
[15] Sylvester J.: Thoughts on inverse orthogonal matrices, simultaneous sign successions, and tessellated pavements in two or more colours, with applications to Newton’s rule, ornamental tile-work, and the theory of numbers. Phil. Mag. 34, 461-475 (1867) · doi:10.1080/14786446708639914
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.