The correct solution to Berlekamp's switching game

DOI10.1016/j.disc.2004.06.015zbMath1054.94023OpenAlexW2051564361MaRDI QIDQ1886357

Daniel Stolarski, Jordan Carlson

Publication date: 18 November 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.06.015

zbMATH Keywords

covering radiuscoding theorylightbulb code

Mathematics Subject Classification ID

Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (5)

The Hardy-Littlewood Inequalities in Sequence Spaces ⋮ “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 ⋮ Constants of the Kahane-Salem-Zygmund inequality asymptotically bounded by 1

Cites Work

• The solution to Berlekamp's switching game
• Covering arrays and intersecting codes

This page was built for publication: The correct solution to Berlekamp's switching game