### Complete Bibliography

[1]
:
Machine solution of no-trump double-dummy bridge problems.
Master's thesis,
Massachussetts Institute of Technology,
20 August 1962.
Advised by J. McCarthy.
A summary of this thesis appeared in *J. Assoc. Comput. Mach.* **10**:3 (1963).
mastersthesis

[2] : “Program for double-dummy bridge problems: A new strategy for mechanical game playing,” J. Assoc. Comput. Mach. 10 : 3 (July 1963), pp. 357–364. Summary of the author’s 1962 Masters thesis. Zbl 0109.35206 article

[3] : Probabilistic mazes. Technical report 20878-4, Bell Telephone Laboratories, 20 June 1963. techreport

[4] : “A class of convolution codes,” Inform. Control 6 : 1 (March 1963), pp. 1–13. MR 0159718 Zbl 0214.47201 article

[5] : Block coding with noiseless feedback. Ph.D. thesis, Massachussetts Institute of Technology, 1964. Advised by R. G. Gallager. phdthesis

[6] : “Note on recurrent codes,” IEEE Trans. Inf. Theory 10 : 3 (July 1964), pp. 257–258. Zbl 0124.11602 article

[7] : “On decoding binary Bose–Chaudhuri–Hocquenghem codes,” IEEE Trans. Information Theory 11 : 4 (October 1965), pp. 577–579. MR 0189921 Zbl 0143.41402 article

[8] : “A polygon problem,” Am. Math. Mon. 72 : 3 (March 1965), pp. 233–241. MR 0179680 Zbl 0132.41105 article

[9] : Two identical binary erasure channels with feedback are exponentially better than one channel at low rates. Technical report SPS 37-37, Jet Propulsion Laboratory, 28 February 1966. Vol. IV, Section XXXI, Task No. 325-10701-1-3310 (125-21-01-01). techreport

[10] : “Distribution of cyclic matrices in a finite field,” Duke Math. J. 33 : 1 (1966), pp. 45–48. MR 0184934 Zbl 0138.01301 article

[11]
:
Nonbinary BCH decoding.
Technical report 502,
University of North Carolina, Chapel Hill,
December 1966.
Institute of Statistics Mimeo Series.
An abstract for this was published in *IEEE Trans. Inform. Theory* **14**:2 (1968).
techreport

[12] : Analysis of channels with unidirectional drift. Space programs summary 37-39, Jet Propulsion Laboratory, 30 June 1966. Volume IV. techreport

[13] : “Lower bounds to error probability for coding on discrete memoryless channels, II,” Inform. Control 10 : 5 (May 1967), pp. 522–552. MR 0216899 article

[14]
:
“A lower bound to the distribution of computation for sequential decoding,”
IEEE Trans. Inform. Theory
13 : 2
(April 1967),
pp. 167–174.
A Russian translation was published in *Nekotoryye Voprosy Teorii Kodirovaniya* (1970).
article

[15] : “On the solution of algebraic equations over finite fields,” Inform. Control 10 : 6 (June 1967), pp. 553–564. MR 0230706 Zbl 0166.04803 article

[16] : “The enumeration of information symbols in BCH codes,” Bell Syst. Tech. J. 46 : 8 (October 1967), pp. 1861–1880. MR 0219344 Zbl 0173.21202 article

[17] : “Lower bounds to error probability for coding on discrete memoryless channels, I,” Inform. Control 10 : 1 (January 1967), pp. 65–103. MR 0210513 Zbl 0245.94007 article

[18] : “Factoring polynomials over finite fields,” Bell Syst. Tech. J. 46 : 8 (October 1967), pp. 1853–1859. MR 0219231 Zbl 0166.04901 article

[19] : “Weight enumeration theorems,” pp. 161–170 in Proceedings of the sixth annual Allerton conference on circuit and system theory (Monticello, IL, 2–4 October 1968). Edited by T. N. Trick and R. T. Chien. University of Illinois (Urbana, IL), 1968. MR 0263534 incollection

[20] : Combinatorial games, I: Hex, Bridgit, and Shannon’s switching game. Technical report, Bell Telephone Laboratories, 1968. techreport

[21] : Grundy functions for certain classes of vines. Technical memo, Bell Telephone Laboratories, 1968. techreport

[22] : Algebraic coding theory. McGraw-Hill (New York), 1968. A 2nd revised edition was published in 1984 and a revision of that in 2015. A Russian translation was published in 1984. MR 0238597 Zbl 0988.94521 book

[23] : “A construction for partitions which avoid long arithmetic progressions,” Canad. Math. Bull. 11 (1968), pp. 409–414. MR 0232743 Zbl 0169.31905 article

[24] : “Nonbinary BCH decoding,” IEEE Trans. Inform. Theory 14 : 2 (March 1968), pp. 242. Abstract only. Abstract for a 1966 technical report. article

[25]
:
“Block coding for the binary symmetric channel with noiseless, delayless feedback,”
pp. 61–88
in
Error correcting codes
(Madison, WI, 6–8 May 1968).
Edited by H. B. Mann.
Publications of the Mathematics Research Center, United States Army, University of Wisconsin 21.
John Wiley (New York),
1968.
A Russian translation was published in *Kibern. Sb.* **9** (1972).
MR
0234756
Zbl
0176.49404
incollection

[26] : “A survey of coding theory,” pp. 3–11 in Recent progress in combinatorics (Waterloo, ON, 20–31 May 1968). Edited by W. T. Tutte. Academic Press (New York), 1969. MR 0252090 Zbl 0199.54101 incollection

[27] : Techniques for computing weight enumerators. Technical report, Bell Telephone Laboratories, 1969. techreport

[28] : “Restrictions on weight distribution of Reed–Muller codes,” Inform. Control 14 : 5 (May 1969), pp. 442–456. MR 0243897 Zbl 0179.49101 article

[29] : “Negacyclic codes for the Lee metric,” pp. 298–316 in Combinatorial mathematics and its applications (Chapel Hill, NC, 10–14 April 1967). Edited by R. C. Bose and T. A. Dowling. UNC Monograph Series in Probability and Statistics 4. University of North Carolina Press (Chapel Hill, NC), 1969. MR 0250738 Zbl 0304.94018 incollection

[30] : The probabilities of certain bridge hands. Technical report, Bell Telephone Laboratories, 1969. techreport

[31] : “On subsets with intersections of even cardinality,” Canad. Math. Bull. 12 (1969), pp. 471–474. MR 0249303 Zbl 0272.05004 article

[32] : On the Carlitz–Uchiyama bound. Technical report, Bell Telephone Laboratories, 1969. techreport

[33] : Burst properties of certain linear binary codes. Technical report MM70-1216-2, Case 20878-4, Bell Telephone Laboratories, 15 January 1970. techreport

[34] : “Irregularities in the distributions of finite sequences,” J. Number Theory 2 : 2 (May 1970), pp. 152–161. MR 0269605 Zbl 0201.05001 article

[35] : “The weight enumerators for certain subcodes of the second order binary Reed–Muller codes,” Inform. Control 17 : 5 (December 1970), pp. 485–500. MR 0290857 Zbl 0211.51304 article

[36]
:
“A lower bound to the distribution of computation for sequential decoding,”
pp. 230–248
in
Nekotoryye voprosy teorii kodirovaniya
[Some problems of coding theory].
Edited by E. L. Bloch and M. S. Pinsker.
Mir (Moscow),
1970.
Russian translation of an article published in *IEEE Trans. Inform. Theory* **13**:2 (1970).
Zbl
0221.94011
incollection

[37] : “Some mathematical properties of a scheme for reducing the bandwidth of motion pictures by Hadamard smearing,” Bell Syst. Tech. J. 49 : 6 (July–August 1970), pp. 969–986. MR 0270810 Zbl 0197.45401 article

[38] : “Weight enumerator for second-order Reed–Muller codes,” IEEE Trans. Information Theory 16 : 6 (November 1970), pp. 745–751. MR 0274196 Zbl 0205.20701 article

[39] : Doubly extended RS codes are cyclic after prenormalization. Technical report, Bell Telephone Laboratories, 1970. techreport

[40] : “On sets of ternary vectors whose only linear dependencies involve an odd number of vectors,” Canad. Math. Bull. 13 : 3 (1970), pp. 363–366. MR 0277544 Zbl 0233.15004 article

[41] : “Factoring polynomials over large finite fields,” Math. Comp. 24 : 111 (July 1970), pp. 713–735. MR 0276200 Zbl 0247.12014 article

[42] : “Some results on normalized truncation groups,” pp. 1–11 in Proceedings of the UMR Mervin J. Kelly communications conference (Rolla, MO, 5–7 October 1970). Edited by J. R. Betten and W. H. Tranter. IEEE (New York), 1970. incollection

[43] : “Coding theory and the Mathieu groups,” Inform. Control 18 : 1 (February 1971), pp. 40–64. MR 0275981 Zbl 0217.28602 article

[44] : Algebraicheskaya teoriya kodirovaniya [Algebraic coding theory]. Edited by S. D. Berman. Mir (Moscow), 1971. Russian translation of 1968 original. MR 0282723 Zbl 0256.94006 book

[45] : “A class of low-rate nonlinear binary codes,” Inform. Control 20 : 2 (March 1972), pp. 182–187. ghost-written and communicated by Berlekamp. MR 0345707 Zbl 0271.94016 article

[46]
:
“Weight distributions of the cosets of the __\( (32,6) \)__ Reed–Muller code,”
IEEE Trans. Information Theory
18 : 1
(January 1972),
pp. 203–207.
MR
0396054
Zbl
0228.94003
article

[47] : “Factoring polynomials,” pp. 1–7 in Proceedings of the third southeastern conference on combinatorics, graph theory and computing (Boca Raton, FL, 28 February–2 March 1972). Edited by F. Hoffman, R. B. Levow, and R. S. D. Thomas. Congressus Numeratium 6. Utilitas Mathematica (Winnipeg), 1972. MR 0349641 Zbl 0262.12011 incollection

[48] : “Constructions for balanced Howell rotations for bridge tournaments,” J. Comb. Theory A 12 : 2 (March 1972), pp. 159–166. MR 0309757 Zbl 0238.05012 article

[49] : A survey of algebraic coding theory: Lectures held at the Department for Automation and Information (Udine, Italy, July 1970). Courses and Lectures, International Centre for Mechanical Sciences 28. Springer (Vienna), 1972. Zbl 0286.94008 book

[50]
:
“Long primitive binary BCH codes have distance __\( d\leq 2n \)__ __\( \ln R^{-1}/\log n\cdots \)__,”
IEEE Trans. Information Theory
18 : 3
(May 1972),
pp. 415–426.
MR
0335129
Zbl
0237.94002
article

[51] : “Gleason’s theorem on self-dual codes,” IEEE Trans. Information Theory 18 : 3 (May 1972), pp. 409–414. MR 0335128 Zbl 0239.94005 article

[52] : “A survey of coding theory,” J. Roy. Statist. Soc. Ser. A 135 : 1 (1972), pp. 44–73. MR 0449862 article

[53] : “Some recent results on the combinatorial game called ‘Welter’s Nim’,” pp. 203–204 in Proceedings of the sixth annual conference on information sciences and systems (23–24 March 1972, Princeton, NJ). Edited by M. E. Van Valkenburg and M. Edelberg. Department of Electrical Engineering, Princeton University, 1972. incollection

[54]
:
“Block coding for the binary symmetric channel with noiseless, delayless feedback,”
Kibern. Sb., Nov. Ser.
9
(1972),
pp. 5–29.
Russian translation of an article published in *Error correcting codes* (1968).
Zbl
0253.94006
article

[55] : An asymptomatic expansion for the quantization error of closely spaced uniform quantizers with Gaussian input. Memo ERL-M381, UCB College of Engineering and Electronic Research Lab, 1973. techreport

[56] : “Extended double-error-correcting binary Goppa codes are cyclic,” IEEE Trans. Information Theory 19 : 6 (November 1973), pp. 817–818. MR 0368919 Zbl 0276.94004 article

[57] : “Goppa codes,” IEEE Trans. Information Theory 19 : 5 (September 1973), pp. 590–592. MR 0378991 Zbl 0269.94003 article

[58] : “A strongly regular graph derived from the perfect ternary Golay code,” pp. 25–30 in A survey of combinatorial theory (Fort Collins, CO, 9–11 September 1971). Edited by J. N. Srivastava. North-Holland (Amsterdam), 1973. MR 0364015 Zbl 0258.05129 incollection

[59] : “Engineering and public service,” The Bridge 69 (1973), pp. 1–3. article

[60] : “Book review: Jacobus H. van Lint, ‘Coding theory’,” IEEE Trans. Inform Theory 19 : 1 (January 1973), pp. 138. article

[61] : The Golay–Viterbi concatenation scheme. Technical report 32-1526, Jet Propulsion Laboratory, 1973. Vol. XVI. techreport

[62] : “The Hackenbush number system for compression of numerical data,” Inform. Control 26 : 2 (October 1974), pp. 134–140. MR 0354140 Zbl 0286.68037 article

[63] : “Some long cyclic linear binary codes are not so bad,” IEEE Trans. Information Theory 20 : 3 (May 1974), pp. 351–356. MR 0381820 Zbl 0309.94023 article

[64] Key papers in the development of coding theory. Edited by E. R. Berlekamp. IEEE Press Selected Reprint Series. IEEE Press (New York), 1974. MR 0384299 Zbl 0910.94001 book

[65] : “Minimum conditions for uniquely determining the generator of a linear sequence,” Utilitas Math. 5 (1974), pp. 305–315. MR 0412158 Zbl 0284.12010 article

[66] : Report of the DARPA study group on advanced computer memory concepts, 1975. misc

[67] : “Algebraic codes For improving the reliability of tape storage,” pp. 497–499 in National computer conference (Anaheim, CA, 19–22 May 1975). AFIPS Conference Proceedings 44. AFIPS Press (Montvale, NJ), 1975. incollection

[68] : “The design of slowly shrinking labelled squares,” pp. 25–27 in Special issue dedicated to Derrick Henry Lehmer, published as Math. Comp. 29 : 129. American Mathematical Society (Providence, RI), January 1975. MR 0373933 Zbl 0341.05019 incollection

[69] : Speedup for the CDC 6600. Working paper 463, Institute For Defense Analysis, 1976. techreport

[70] : “Making change,” Math. Mag. 49 : 4 (September 1976), pp. 195–198. MR 0410846 Zbl 0342.60066 article

[71] : “An analog to the discriminant over fields of characteristic two,” J. Algebra 38 : 2 (February 1976), pp. 315–317. MR 0404197 Zbl 0327.12101 article

[72] : Merging and sorting on Cray I. Working paper 464, Institute For Defense Analysis, 1976. techreport

[73] : “Cooperative bridge bidding,” IEEE Trans. Inform. Theory 22 : 6 (November 1976), pp. 753–756. correspondence. article

[74] : Speedup for the Cray I. Working paper 465, Institute For Defense Analysis, 1976. techreport

[75] : “Long block codes which use soft decisions and correct erasure bursts without interleaving,” pp. 1–2 in NTC ’77 conference record (Los Angeles, 5–7 December 1977), vol. 1. IEEE (New York), 1977. National Telecommunications Conference. incollection

[76] : “Readable erasures improve the performance of Reed–Solomon Codes,” IEEE Trans. Inform. Theory 24 : 5 (September 1978), pp. 632–633. article

[77] : “On the inherent intractability of certain coding problems,” IEEE Trans. Information Theory 24 : 3 (1978), pp. 384–386. MR 0495180 Zbl 0377.94018 article

[78] : “Book Review: Robert J. McEliece, ‘The theory of information and coding: A mathematical framework for communication’,” Bull. Am. Math. Soc. 84 : 6 (1978), pp. 1351–1353. MR 1567098 article

[79] : “The technology of error-correcting codes,” Proc. IEEE 68 : 5 (May 1980), pp. 564–593. article

[80] : “Report of the public cryptography study group,” Comm. ACM 24 : 7 (July 1981), pp. 434–449. 1979–1981 report of an American Council of Education study group. article

[81]
:
Winning ways for your mathematical plays,
vol. 1: Games in general.
Academic Press (London and New York),
1982.
A German translation of this volume was published in two parts as *Gewinnen: Strategien für mathematische Spiele* Band 1: *Von der Pike auf* (1985) and Band 2: *Bäumchen-wechsle-dich* (1985). Likewise, a second English edition was published in two parts in 2001 (“Volume 1”) and 2003 (“Volume 2”).
MR
654501
Zbl
0485.00025
book

[82]
:
Winning ways for your mathematical plays,
vol. 2: Games in particular.
Academic Press (London and New York),
1982.
A German translation of this volume was published in two parts as *Gewinnen: Strategien für mathematische Spiele* Band 3: *Fallstudien* (1986) and Band 4: *Solitairspiele* (1985). Likewise, a second English edition was published in 2003 (“Volume 3”) and 2003 (“Volume 4”).
MR
654502
book

[83] : “Bit-serial Reed–Solomon encoders,” IEEE Trans. Inf. Theory 28 : 6 (November 1982), pp. 869–874. Zbl 0492.94016 article

[84] : “The construction of fast, high-rate, soft decision block decoders,” IEEE Trans. Inform. Theory 29 : 3 (May 1983), pp. 372–377. MR 712403 article

[85] : “Error-correcting codes for digital audio,” pp. 127–139 in Digital audio (Rye, NY, 3–6 June 1982). Edited by B. Blesser, B. Locanthi, and T. G. Stockham, Jr. Audio Engineering Society (New York), 1983. incollection

[86] : Algebraic coding theory, 2nd revised edition. Aegean Park Press (Laguna Hills, CA), 1984. Revised republication of 1968 original. Zbl 1320.94002 book

[87] : “Average case optimized buffered decoders,” pp. 145–158 in The impact of processing techniques on communications (Chateau de Bonas, France, 11–22 July 1983). Edited by J. K. Skwirzynski. NATO ASI Series 91. Springer (Dordrecht), 1985. incollection

[88]
:
Gewinnen. Strategien für mathematische Spiele
[Winning. Strategies for mathematical games],
vol. 1: Von der Pike auf [From the ground up].
Friedrich Vieweg & Sohn (Braunschweig),
1985.
With a foreword by Konrad Jacobs, Maria Reményi and Gerta Seiffert.
German translation (with adapted title) of the first half of *Winning ways for your mathematical plays*, vol. 1 (1982).
MR
830941
Zbl
0584.00006
book

[89]
:
Gewinnen. Strategien für mathematische Spiele
[Winning. Strategies for mathematical games],
vol. 4: Solitairspiele [Solitaire games].
Friedrich Vieweg & Sohn (Braunschweig),
1985.
German translation (with adapted title) of (approximately) the second half of *Winning ways for your mathematical plays* vol. 2 (1982).
MR
838083
Zbl
0584.00009
book

[90] : “An error-control code with an imbalance of ones and zeros to provide a residual carrier component,” pp. 31.1.1–31.1.4 in Communications-computers: Teamed for the ’90’s (Monterey, CA, 5–9 October 1986), vol. 2. IEEE (Piscataway, NJ), 1986. incollection

[91]
:
Gewinnen. Strategien für mathematische Spiele
[Winning. Strategies for mathematical games],
vol. 3: Fallstudien [Case studies].
Friedrich Vieweg & Sohn (Braunschweig),
1986.
German translation (with adapted title) of (approximately) the first half of *Winning ways for your mathematical plays* vol. 2 (1982).
MR
838082
Zbl
0584.00008
book

[92] : If tennis players are equally good, server has no advantage. Technical memo, Cyclotomics, Inc., 22 September 1986. techreport

[93]
:
Gewinnen. Strategien für mathematische Spiele
[Winning. Strategies for mathematical games],
vol. 2: Bäumchen-wechsle-dich.
Friedrich Vieweg & Sohn (Braunschweig),
1986.
With a foreword by Konrad Jacobs, Maria Reményi and Gerta Seiffert.
German translation (with adapted title) of the second half of *Winning ways for your mathematical plays*, vol. 1 (1982).
MR
830940
Zbl
0584.00007
book

[94] : Variable depth helical interleavers. Technical report, Cyclotomics, Inc., 1986. report to NSF. techreport

[95] : “The application of error control to communications,” IEEE Comm. Mag. 25 : 4 (April 1987), pp. 44–57. article

[96]
:
“Blockbusting and domineering,”
J. Combin. Theory Ser. A
49 : 1
(1988),
pp. 67–116.
What the author describes as an “introductory advertisement” to this article was published in *The lighter side of mathematics* (1994).
MR
957210
Zbl
0651.90092
article

[97] : “Elongated burst correction with Reed–Solomon codes” in International conference on communication technology (Beijing, China, 12–14 July 1989). Publishing House of Electronics Industry (Beijing), 1989. incollection

[98]
:
“Two-person, perfect-information games,”
pp. 275–287
in
The legacy of John von Neumann
(Hempstead, NY, 29 May–4 June 1988).
Edited by J. Glimm, J. Impagliazzo, and I. Singer.
Proceedings of Symposia in Pure Mathematics 50.
American Mathematical Society (Providence, RI),
1990.
Parts of this are identical to an article published in *The lighter side of mathematics* (1994).
MR
1067762
Zbl
0714.90109
incollection

[99] : “Introductory overview of mathematical Go endgames,” pp. 73–100 in Combinatorial games (Columbus, OH, 6–7 August 1990). Edited by R. K. Guy. Proceedings of Symposia in Applied Mathematics 43. American Mathematical Society (Providence, RI), 1991. MR 1095541 Zbl 0744.90103 incollection

[100] : Mathematical Go: Chilling gets the last point. A K Peters (Wellesley, MA), 1994. With a foreword by James Davies. MR 1274921 Zbl 0852.90149 book

[101]
:
“Introduction to blockbusting and domineering,”
pp. 137–148
in
The lighter side of mathematics: Proceedings of the Eugène Strens memorial conference on recreational mathematics and its history.
Edited by R. K. Guy and R. E. Woodrow.
MAA Spectrum.
Cambridge University Press,
1994.
The author describes this as an “introductory advertisement” to an article published in *J. Combin. Theory Ser.* **49**:1 (1988). Parts of it are identical to an article published in *Proceedings of the John von Neumann Symposium* (1988).
incollection

[102]
:
“Where is the thousand dollar ko?,”
Go World
71
(1994),
pp. 65–80.
A later version of this was published in *More games of no chance* (1996).
article

[103] : “A hypersystolic Reed–Solomon decoder,” pp. 205–241 in Reed–Solomon codes and their applications. Edited by S. B. Wicker and V. K. Bhargava. IEEE Press (Piscataway, NJ), 1994. Zbl 1126.94356 incollection

[104] : Risk and innovation: The role and importance of small, high-tech companies in the U.S. economy. The National Academies Press (Washington, DC), 1995. by the National Academy of Engineering’s Committee on Technology, Management, and Capital in Small High-Tech Companies. book

[105] : “The economist’s view of combinatorial games,” pp. 365–405 in More games of no chance (Berkeley, CA, 11–21 July 2000). Edited by R. J. Nowakowski. MSRI Publications 29. Cambridge University Press, 1996. MR 1427978 Zbl 0872.90131 incollection

[106] : Generalized thermography: Algorithms, implementation, and application to Go endgames. Technical report TR-96-030, International Computer Science Institute (Berkeley, CA), October 1996. techreport

[107]
:
“Where is the ‘thousand-dollar ko’?,”
pp. 203–226
in
More games of no chance
(Berkeley, CA, 11–21 July 2000).
Edited by R. J. Nowakowski.
MSRI Publications 29.
Cambridge University Press,
1996.
An earlier version of this was published in *Go World* **71** (1994).
MR
1427966
Zbl
0873.90141
incollection

[108]
:
“Bounded distance __\( +1 \)__ soft-decision Reed–Solomon decoding,”
IEEE Trans. Inf. Theory
42 : 3
(May 1996),
pp. 704–720.
Zbl
0860.94032
article

[109] : “The solution of a problem of Ulam on searching with lies,” pp. 244–247 in 1988 IEEE international symposium on information theory (Cambridge, MA, 16–21 August 1998). IEEE (Piscataway, NJ), 1998. incollection

[110] The mathemagician and pied puzzler: A collection in tribute to Martin Gardner (Atlanta, January 1993). Edited by E. R. Berlekamp and T. Rodgers. A K Peters (Natick, MA), 1999. MR 1678000 Zbl 0926.00006 book

[111] : The dots-and-boxes game: Sophisticated child’s play. A K Peters (Natick, MA), 2000. MR 1780088 Zbl 1058.00500 book

[112] : “Unimodular arrays,” pp. 77–88 in Sol Golomb’s 60th birthday symposium (Oxnard, CA, 29–31 May 1992), published as Comput. Math. Appl. 39 : 11. Issue edited by H. Taylor. Elsevier (Amsterdam), June 2000. MR 1766383 Zbl 0953.05010 incollection

[113]
:
“Sums of __\( N\times 2 \)__ Amazons,”
pp. 1–34
in
Game theory, optimal stopping, probability and statistics: Papers in honor of Thomas S. Ferguson.
Edited by F. T. Bruss and L. M. Le Cam.
IMS Lecture Notes Monograph Series 35.
Institute of Mathematical Statistics (Beachwood, OH),
2000.
MR
1833848
Zbl
0988.91012
incollection

[114] : Winning ways for your mathematical plays, 2nd edition, vol. 1. A K Peters (Natick, MA), 2001. Expanded republication of (approximately) the first half of the original volume 1 (1982). MR 1808891 Zbl 1005.00004 book

[115]
:
“The 4G4G4G4G4 problems and solutions,”
pp. 231–241
in
More games of no chance
(Berkeley, CA, 24–28 July 2000).
Edited by R. J. Nowakowski.
MSRI Publications 42.
Cambridge University Press,
2002.
This is related to an article published in *Puzzlers’ tribute: A feast for the mind* (2002).
MR
1973015
Zbl
1062.91522
incollection

[116] : “Forcing your opponent to stay in control of a loony dots-and-boxes endgame,” pp. 317–330 in More games of no chance (Berkeley, CA, 24–28 July 2000). Edited by R. J. Nowakowski. MSRI Publications 42. Cambridge University Press, 2002. MR 1973020 Zbl 1062.91523 incollection

[117] : “Claude Elwood Shannon (1916–2001),” Notices Am. Math. Soc. 49 : 1 (2002), pp. 8–16. MR 1871259 Zbl 1126.01319 article

[118] : “Idempotents among partisan games,” pp. 3–23 in More games of no chance (Berkeley, CA, 24–28 July 2000). Edited by R. J. Nowakowski. MSRI Publications 42. Cambridge University Press, 2002. MR 1973000 Zbl 1047.91521 incollection

[119] : “The performance of block codes,” Notices Am. Math. Soc. 49 : 1 (2002), pp. 17–22. MR 1871260 Zbl 1126.94300 article

[120]
:
“Four games for Gardner,”
pp. 383–386
in
Puzzlers’ tribute: A feast for the mind.
Edited by D. Wolfe and T. Rodgers.
A K Peters (Natick, MA),
2002.
A related article was published in *More games of no chance* (2002).
incollection

[121] : Winning ways for your mathematical plays, 2nd edition, vol. 2. A K Peters (Natick, MA), 2003. Expanded republication of (approximately) the first half of the original volume 1 (1982). MR 1959113 Zbl 1011.00009 book

[122] : “Introduction,” pp. xi–xiii in Mathematical properties of sequences and other combinatorial structures (Los Angeles, 30 May–1 June 2002). Edited by J.-S. No, H.-y. Song, T. Helleseth, and P. V. Kumar. International Series in Engineering and Computer Science 726. Kluwer Academic (Dordrecht), 2003. Conference dedicated to the 70th birthday of Solomon W. Golomb. Zbl 1042.01512 incollection

[123] : “Analysis of composite corridors,” pp. 213–229 in Computers and games: Third international conference (Edmonton, AB, 25–27 July 2002). Edited by J. Schaeffer, M. Müller, and Y. Björnsson. Lecture Notes in Computer Science 2883. Springer (Berlin), 2003. incollection

[124] : Winning ways for your mathematical plays, 2nd edition, vol. 3. A K Peters (Natick, MA), 2003. Expanded republication of (approximately) the first half of the original volume 2 (1982). MR 2006327 Zbl 1083.00003 book

[125] : Winning ways for your mathematical plays, 2nd edition, vol. 4. A K Peters (Wellesley, MA), 2004. Expanded republication of (approximately) the second half of the original volume 2 (1982). MR 2051076 Zbl 1084.00002 book

[126] : “Bettor math,” Am. Sci. (November–December 2005). Book review: W. Poundstone, “Fortune’s formula: The untold story of the scientific betting system that beat the casinos and Wall Street”. article

[127] : “Baduk + coupons,” pp. 39–55 in Proceedings ICOB 2006: The 4th international conference on Baduk (Jeon-ju, Korea, 22–23 October 2006). Department of Baduk Studies, Myongji University (Seoul), 2006. incollection

[128] : Review of mathematics programs of Air Force Office of Scientific Research by National Research Council. The National Academies Press (Washington, DC), 2006. book

[129] : Mathematics and Go, 2006. DVD of lecture given at UC-Berkeley Faculty Club, Letters & Science Faculty Forum, 6 February 2006. misc

[130] : “Yellow-brown Hackenbush,” pp. 413–418 in Games of no chance 3 (Banff, AB, June 2005). Edited by M. H. Albert and R. J. Nowakowski. MSRI Publications 56. Cambridge University Press, 2009. Zbl 1192.91048 incollection

[131] : “The Galetron,” Games Econom. Behav. 66 : 2 (July 2009), pp. 598. In memoriam: David Gale. MR 2543261 Zbl 1165.01312 article

[132] : Some common misconceptions, 5 April 2013. 49 minute video of Stanford University’s 2013 Kailath Lecture. misc

[133] : Algebraic coding theory, revised edition. World Scientific Publishing (Hackensack, NJ), 2015. Revision of 2nd edition of 1968 original. MR 3380755 Zbl 1320.94001 book