The solution to Berlekamp's switching game
From MaRDI portal
Publication:1115849
DOI10.1016/0012-365X(89)90141-6zbMath0664.94024MaRDI QIDQ1115849
N. J. A. Sloane, Peter C. Fishburn
Publication date: 1989
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (8)
The correct solution to Berlekamp's switching game ⋮ Quasi-random multilinear polynomials ⋮ “Lights Out” and Variants ⋮ Upper bounds for the constants of Bennett's inequality and the Gale–Berlekamp switching game ⋮ A Gale-Berlekamp permutation-switching problem ⋮ \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata ⋮ First order deformations of the Fourier matrix ⋮ Constants of the Kahane-Salem-Zygmund inequality asymptotically bounded by 1
Cites Work
- Unnamed Item
- A new approach to the covering radius of codes
- On extensions of the Gale-Berlekamp switching problem and constants of \(\ell_p\)-spaces
- The covering radius of cyclic codes of length up to 31 (Corresp.)
- On the covering radius of codes
- Covering radius---Survey and recent results
- Further results on the covering radius of codes
- Subcodes and covering radius (Corresp.)
- On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius
- On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
- Lower bounds for binary covering codes
- Improved sphere bounds on the covering radius of codes
- Explicit codes with low covering radius
- Covering arrays and intersecting codes
- Minimization of ±1 matrices under line shifts
This page was built for publication: The solution to Berlekamp's switching game
