No abstract

No abstract

Undergraduate Topics in Computer Science (UTiCS) delivers high-quality instructional content for undergraduates studying in all areas of computing and information science. From core foundational and theoretical material to final-year topics and applications, UTiCS books take a fresh, concise, and modern approach and are ideal for self-study or for a one-or two-semester course. The texts are all authored by established experts in their fields, reviewed by an international advisory board, and contain numerous examples and problems. Many include fully worked solutions.More information about this series at

No abstract

Let A 2 (n, d) be the maximum size of a binary code of length n and minimum distance d. In this paper we present the following new lower bounds: A 2 (18, 4) ≥ 5632, A 2 (21, 4) ≥ 40960, A 2 (22, 4) ≥ 81920, A 2 (23, 4) ≥ 163840, A 2 (24, 4) ≥ 327680, A 2 (24, 10) ≥ 136, and A 2 (25, 6) ≥ 17920. The new lower bounds are a result of a systematic computer search over transitive permutation groups.