The solution to Berlekamp's switching game
type: Item
instance of: scholarly article
title: The solution to Berlekamp's switching game
zbMATH Open document ID: 0664.94024
DOI: 10.1016/0012-365X(89)90141-6
author: N. J. A. Sloane
author: Peter Fishburn
published in: Discrete Mathematics
publication date: 1989-01-01T00:00:00Z
review text: Berlekamp's game consists of a 10\(\times 10\) array of light-bulbs, with 100 switches at the back, one for each bulb, and 20 switches at the front that can complement any row or column of bulbs. For any initial set S of bulbs turned on using the back switches, let f(S) be the minimal number of lights that can be achieved by throwing any combination of row and column switches. The probem is to find the maximum of f(S) over all choices of S. We show that the answer is 34. We also determine the solution for \(n\times n\) arrays with \(1\leq n\leq 9\).
Mathematics Subject Classification ID: 94B99
zbMATH DE Number: 4087601
zbMATH Keywords: covering radius of codes
MaRDI profile type: Publication
cites work: Subcodes and covering radius (Corresp.)
cites work: Minimization of ±1 matrices under line shifts
cites work: Covering radius---Survey and recent results
cites work: Further results on the covering radius of codes
cites work: The covering radius of cyclic codes of length up to 31 (Corresp.)
cites work: On extensions of the Gale-Berlekamp switching problem and constants of \(\ell_p\)-spaces
cites work: On the covering radius of codes
cites work: Lower bounds for binary covering codes
cites work: On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius
cites work: On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
cites work: Q3734303
cites work: Explicit codes with low covering radius
cites work: A new approach to the covering radius of codes
cites work: Covering arrays and intersecting codes
cites work: Improved sphere bounds on the covering radius of codes
description: scientific article; zbMATH DE number 4087601