Errata

Page 87, Fig. 3.9 If one thinks of the vertices of the triangles with value 0 being left, 1 being top right, and 2 being bottom right, then one would obtain this drawing from the code {000,011,220}. Formally, though, there is nothing wrong with the picture, since this code happens to be equivalent to the code {000,011,221}. Page 130, line 16 Z_2 should be typeset in regular math font in all places (pointed out by Carlo Hämäläinen)
Page 168, line -7 "C" should read "Q" (pointed out by Christian Mayer)
Page 170, line 13 "partition" should read "partitions"
Page 264, Sect. 8.1.3, line 1 "3n" should read "n3"
Page 348, Research Problem 12.14 It is shown in [398] (in the framework of partial geometries) that the number of 1-hyperfactorizations of K10 is exactly two, so this problem is not open.
Page 373, [151] "Discrete Math." should read "Ann. Discrete Math."
Page 393, [527] The English translation appeared in 1969.

Addenda

Table 6.8 There are 16 2-(45,9,2) designs. "P. Kaski and P. R. J. Östergård, There are exactly five biplanes with k=11, J. Combin. Des. 16 (2008), 117-127."

Table 6.10 There are five 2-(56,11,2) designs. "P. Kaski and P. R. J. Östergård, There are exactly five biplanes with k=11, J. Combin. Des. 16 (2008), 117-127."

Table 7.2 There are 38408 binary codes with length 14, size 1024 and minimum distance 3, and they have 5983 extensions. There are 5983 binary codes with length 15, size 2048 and minimum distance 3, and they have 2165 extensions. "P. R. J. Östergård and O. Pottonen, The perfect binary one-error-correcting codes of length 15: Part I—Classification, IEEE Trans. Inform. Theory 55 (2009), 4657-4660." Preprint at arXiv:0806.2513.

Research Problem 7.19 has been considered in "P. R. J. Östergård, Classification of binary constant weight codes, IEEE Trans. Inform. Theory 56 (2010), 3779-3785."

Research Problem 7.31 has been solved in "G. Kéri and P. R. J. Östergård, The number of inequivalent (2R+3,7)R optimal covering codes, J. Integer Seq. 9 (2006), Article 06.4.7, 8pp."

Page 243 The 28 (6,6)33 codes as well as the inequivalent codes attaining K3(n,R)=3 have been classified in "G. Kéri, Classification results for non-mixed and mixed optimal covering codes: A survey, in Proc. 19th Int'l Symposium on Mathematical Theory of Networks and Systems (MTNS 2010, Budapest, Hungary, July 5-9, 2010), pp. 171-176."

Table 8.1 There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of K14, "P. Kaski, and P. R. J. Östergård, There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of K14, J. Cobmin. Des. 17 (2009), 147-159."

Table 8.2 There are 2,036,029,552,582,883,134,196,099 main classes of Latin squares of order 11, "A. Hulpke, P. Kaski, and P. R. J. Östergård, The number of Latin squares of order 11, Math. Comp., to appear." Preprint at arXiv:0909.3402.

Research Problem 8.7 An exhaustive study of transversals in the Latin squares of order 9 has been carried out in "B. D. McKay, J. C. McLeod, and I. M. Wanless, The number of transversals in a Latin square, Des. Codes Cryptogr. 40 (2006), 269-284."

Research Problem 12.14: See Errata above.

Back

Latest update: February 7, 2012.