Kittens, mathematical blackjack, and combinatorial codes

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Can coding theory help you be a better gambler? Do unexpected combinatorial patterns (called Steiner systems) arise naturally in codes? This chapter attempts to address these types of questions. (The books by Assmus and Key (Designs and Codes. Cambridge University Press, Cambridge, 1992) and Conway and Sloane (Sphere Packings, Lattices and Groups, 3rd edn. Springer, Berlin, 1999) do into more detail in these matters and are highly recommended.) This chapter gives an exposition of some ideas of Hadamard and Mathieu, as well as ideas of Conway, Curtis, and Ryba connecting the Steiner system S(5,6,12) with a card game called mathematical blackjack. An implementation in SAGE is described as well. Then we turn to one of the most beautiful results in coding theory, the Assmus–Mattson Theorem, which relates certain linear codes to combinatorial structures called designs. Finally, we describe an old scheme for placing bets using Golay codes (the scheme was in fact published in a Finnish soccer magazine years before the error-correcting code itself was discovered (Hämäläinen et al., Am. Math. Mon. 102:579–588, 1995)). Open questions which arise in this chapter include conjectures on Hadamard matrices and on which block designs “arise” from an error-correcting code.

Cite

CITATION STYLE

APA

Joyner, D., & Kim, J. L. (2011). Kittens, mathematical blackjack, and combinatorial codes. In Applied and Numerical Harmonic Analysis (pp. 47–70). Springer International Publishing. https://doi.org/10.1007/978-0-8176-8256-9_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free