MR Collaboration Distance

My MR collaboration distance to Claude Shannon is 4, via the following path:

1. H. K. Miyamoto, S. I. R. Costa, H. N. Sá Earp. Constructive spherical codes by Hopf foliations. IEEE Trans. Inform. Theory 67 (2021), no. 12, 7925–7939. MR4346069

2. N. J. A. Sloane, V. A. Vaishampayan, S. I. R. Costa A note on projecting the cubic lattice. Discrete Comput. Geom. 46 (2011), no. 3, 472–478. MR2826964

3. N. J. A. Sloane, E. R. Berlekamp Weight enumerator for second-order Reed-Muller codes. IEEE Trans. Inform. Theory IT-16 (1970), 745–751. MR274196

4. C. E. Shannon, R. G. Gallager, E. R. Berlekamp. Lower bounds to error probability for coding on discrete memoryless channels. I. Information and Control 10 (1967), 65–103. MR210513

Another path with the same distance is the following:

1. F. C. C. Meneghetti, H. K. Miyamoto, S. I R. Costa, M. H. M. Costa. Revisiting lattice tiling decomposition and dithered quantisation. Geometric science of information. Part I, 318–327. Lecture Notes in Comput. Sci. 14071, Springer (2023). MR4638271

2. M. H. M. Costa, T. M. Cover. On the similarity of the entropy power inequality and the Brunn-Minkowski inequality. IEEE Trans. Inform. Theory 30 (1984), no.6, 837–839. MR0782217

3. S. W. Golomb, E. Berlekamp, T. M. Cover, R. G. Gallager, J. L. Massey, A. J. Viterbi. Claude Elwood Shannon (1916–2001). Notices Amer. Math. Soc. 49 (2002), no.1, 8–16. MR1871259

4. C. E. Shannon, R. G. Gallager, E. R. Berlekamp. Lower bounds to error probability for coding on discrete memoryless channels. I. Information and Control 10 (1967), 65–103. MR0210513