Gossip Latin square and the meet-all gossipers problem

Nethanel Gelernter, Amir Herzberg

Research output: Contribution to journalArticlepeer-review


Given a network of n=2k gossipers, we want to schedule a cyclic calendar of meetings between all of them, such that: (1) each gossiper meets (gossips) only once a day, with one other gossiper, (2) in every (n-1) consecutive days, each gossiper meets all other gossipers, and (3) every gossip, initiated by any gossiper, will reach all gossipers within k=log (n) days. In this paper we study the above stated meet-all gossipers problem, by defining and constructing the Gossip Latin Square (GLS), a combinatorial structure which solves the problem. We then present an efficient construction of GLS, based on maximal Fibonacci LFSR.

Original languageEnglish
Pages (from-to)738-743
Number of pages6
JournalInformation Processing Letters
Issue number10
StatePublished - 2 Aug 2013

Bibliographical note

Funding Information:
We would like to thank Prof. David Peleg for his helpful comments. This research was supported by grants from the Ministry of Science and Technology , Israel, and grant 1354/11 from the Israeli Science Foundation .

Publisher Copyright:
© 2015 Elsevier B.V.


  • Combinatorial problems
  • Gossip
  • Latin square


Dive into the research topics of 'Gossip Latin square and the meet-all gossipers problem'. Together they form a unique fingerprint.

Cite this