{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T18:11:08Z","timestamp":1776795068744,"version":"3.51.2"},"reference-count":30,"publisher":"American Mathematical Society (AMS)","issue":"277","license":[{"start":{"date-parts":[[2012,6,21]],"date-time":"2012-06-21T00:00:00Z","timestamp":1340236800000},"content-version":"am","delay-in-days":366,"URL":"https:\/\/www.ams.org\/publications\/copyright-and-permissions"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"<p>\n                    A new ordering, extending the notion of universal cycles of Chung et al. (1992), is proposed for the blocks of\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"k\">\n                        <mml:semantics>\n                          <mml:mi>k<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">k<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    -uniform set systems. Existence of minimum coverings of pairs by triples that possess such an ordering is established for all orders. The application to the construction of short 2-radius sequences is given, along with some new 2-radius sequences found through a computer search.\n                  <\/p>","DOI":"10.1090\/s0025-5718-2011-02473-7","type":"journal-article","created":{"date-parts":[[2011,6,21]],"date-time":"2011-06-21T08:07:10Z","timestamp":1308643630000},"page":"585-603","source":"Crossref","is-referenced-by-count":11,"title":["Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences"],"prefix":"10.1090","volume":"81","author":[{"given":"Yeow","family":"Chee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"San","family":"Ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiande","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"14","published-online":{"date-parts":[[2011,6,21]]},"reference":[{"issue":"9","key":"1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","article-title":"The input\/output complexity of sorting and related problems","volume":"31","author":"Aggarwal, Alok","year":"1988","journal-title":"Comm. ACM","ISSN":"https:\/\/id.crossref.org\/issn\/0001-0782","issn-type":"print"},{"key":"2","isbn-type":"print","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/conm\/111\/1079733","article-title":"A note on Hamilton cycles in block-intersection graphs","author":"Alspach, Brian","year":"1990","ISBN":"https:\/\/id.crossref.org\/isbn\/0821851187"},{"issue":"9","key":"3","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/360336.360343","article-title":"Efficient generation of the binary reflected Gray code and its applications","volume":"19","author":"Bitner, James R.","year":"1976","journal-title":"Comm. ACM","ISSN":"https:\/\/id.crossref.org\/issn\/0001-0782","issn-type":"print"},{"key":"4","unstructured":"S. R. Blackburn and J. F. Mckee, Constructing \ud835\udc58-radius sequences, arXiv:1006.5812v1 (2010)."},{"issue":"1","key":"5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(77)90037-1","article-title":"Group divisible designs with block-size four","volume":"20","author":"Brouwer, A. E.","year":"1977","journal-title":"Discrete Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0012-365X","issn-type":"print"},{"issue":"1-3","key":"6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0012-365X(92)90699-G","article-title":"Universal cycles for combinatorial structures","volume":"110","author":"Chung, Fan","year":"1992","journal-title":"Discrete Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0012-365X","issn-type":"print"},{"issue":"1","key":"7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0097-3165(92)90099-G","article-title":"A new class of group divisible designs with block size three","volume":"59","author":"Colbourn, Charles J.","year":"1992","journal-title":"J. Combin. Theory Ser. A","ISSN":"https:\/\/id.crossref.org\/issn\/0097-3165","issn-type":"print"},{"key":"8","series-title":"Oxford Mathematical Monographs","isbn-type":"print","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198535768.001.0001","volume-title":"Triple systems","author":"Colbourn, Charles J.","year":"1999","ISBN":"https:\/\/id.crossref.org\/isbn\/0198535767"},{"key":"9","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"de Bruijn, N. G.","year":"1946","journal-title":"Nederl. Akad. Wetensch., Proc.","ISSN":"https:\/\/id.crossref.org\/issn\/0370-0348","issn-type":"print"},{"key":"10","isbn-type":"print","volume-title":"Gray codes, Universal cycles and configuration orderings for block designs","author":"Dewar, Megan","year":"2007","ISBN":"https:\/\/id.crossref.org\/isbn\/9780494334881"},{"issue":"3","key":"11","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(84)90091-7","article-title":"An algorithm for generating subsets of fixed size with a strong minimal change property","volume":"19","author":"Eades, Peter","year":"1984","journal-title":"Inform. Process. Lett.","ISSN":"https:\/\/id.crossref.org\/issn\/0020-0190","issn-type":"print"},{"key":"12","doi-asserted-by":"crossref","first-page":"709","DOI":"10.2140\/pjm.1958.8.709","article-title":"Minimal coverings of pairs by triples","volume":"8","author":"Fort, M. K., Jr.","year":"1958","journal-title":"Pacific J. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0030-8730","issn-type":"print"},{"issue":"8","key":"13","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1145\/360933.360991","article-title":"Consecutive storage of relevant records with redundancy","volume":"18","author":"Ghosh, Sakti P.","year":"1975","journal-title":"Comm. ACM","ISSN":"https:\/\/id.crossref.org\/issn\/0001-0782","issn-type":"print"},{"key":"14","unstructured":"J. W. Gilkerson and J. W. Jaromczyk, Restoring the order of images in a sequence of MRI slices, unpublished manuscript (2002)."},{"key":"15","unstructured":"J. W. Gilkerson, J. W. Jaromczyk, and Z. Lonc, On constructing sequences of radius \ud835\udc58 using finite geometries, unpublished manuscript."},{"key":"16","unstructured":"F. Gray, Pulse code communication, 1953 (file 1947), US Patent 2,632,058."},{"key":"17","first-page":"129","article-title":"The closure of all subsets of {3,4,\u22ef,10} which include 3","volume":"41","author":"Gronau, H.-D. O. F.","year":"1995","journal-title":"Ars Combin.","ISSN":"https:\/\/id.crossref.org\/issn\/0381-7032","issn-type":"print"},{"issue":"1-3","key":"18","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0012-365X(93)E0140-Y","article-title":"Cycles in the block-intersection graph of pairwise balanced designs","volume":"137","author":"Hare, Donovan R.","year":"1995","journal-title":"Discrete Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0012-365X","issn-type":"print"},{"issue":"4","key":"19","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1002\/(SICI)1520-6610(1999)7:4<243::AID-JCD2>3.3.CO;2-1","article-title":"Hamilton cycles in block-intersection graphs of triple systems","volume":"7","author":"Hor\u00e1k, Peter","year":"1999","journal-title":"J. Combin. Des.","ISSN":"https:\/\/id.crossref.org\/issn\/1063-8539","issn-type":"print"},{"key":"20","first-page":"91","article-title":"Decomposing Steiner triple systems into small configurations","volume":"26","author":"Hor\u00e1k, Peter","year":"1988","journal-title":"Ars Combin.","ISSN":"https:\/\/id.crossref.org\/issn\/0381-7032","issn-type":"print"},{"issue":"4","key":"21","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/S0895480191220861","article-title":"On universal cycles for \ud835\udc58-subsets of an \ud835\udc5b-set","volume":"7","author":"Hurlbert, Glenn","year":"1994","journal-title":"SIAM J. Discrete Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0895-4801","issn-type":"print"},{"key":"22","unstructured":"B. Jackson, Universal cycles of 4-subsets and 5-subsets, unpublished manuscript."},{"issue":"1-3","key":"23","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0012-365X(93)90330-V","article-title":"Universal cycles of \ud835\udc58-subsets and \ud835\udc58-permutations","volume":"117","author":"Jackson, B. W.","year":"1993","journal-title":"Discrete Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0012-365X","issn-type":"print"},{"key":"24","isbn-type":"print","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/978-3-540-30551-4_52","article-title":"Sequences of radius \ud835\udc58: how to fetch many huge objects into small memory for pairwise computations","author":"Jaromczyk, Jerzy W.","year":"2004","ISBN":"https:\/\/id.crossref.org\/isbn\/3540241310"},{"issue":"165","key":"25","first-page":"49","article-title":"Some remarks on pairwise balanced designs","author":"Lenz, Hanfried","year":"1984","journal-title":"Mitt. Math. Sem. Giessen","ISSN":"https:\/\/id.crossref.org\/issn\/0373-8221","issn-type":"print"},{"issue":"2","key":"26","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/0196-6774(88)90036-3","article-title":"Adjacent interchange generation of combinations","volume":"9","author":"Ruskey, Frank","year":"1988","journal-title":"J. Algorithms","ISSN":"https:\/\/id.crossref.org\/issn\/0196-6774","issn-type":"print"},{"issue":"4","key":"27","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","article-title":"A survey of combinatorial Gray codes","volume":"39","author":"Savage, Carla","year":"1997","journal-title":"SIAM Rev.","ISSN":"https:\/\/id.crossref.org\/issn\/1095-7200","issn-type":"print"},{"issue":"6","key":"28","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1145\/602220.602225","article-title":"Towards a theory of cache-efficient algorithms","volume":"49","author":"Sen, Sandeep","year":"2002","journal-title":"J. ACM","ISSN":"https:\/\/id.crossref.org\/issn\/0004-5411","issn-type":"print"},{"key":"29","series-title":"Discrete Mathematics and its Applications (Boca Raton)","isbn-type":"print","volume-title":"Handbook of combinatorial designs","year":"2007","ISBN":"https:\/\/id.crossref.org\/isbn\/9781584885061","edition":"2"},{"key":"30","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0097-3165(72)90028-3","article-title":"An existence theory for pairwise balanced designs. I. Composition theorems and morphisms","volume":"13","author":"Wilson, Richard M.","year":"1972","journal-title":"J. Combinatorial Theory Ser. A","ISSN":"https:\/\/id.crossref.org\/issn\/0097-3165","issn-type":"print"}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.ams.org\/mcom\/2012-81-277\/S0025-5718-2011-02473-7\/S0025-5718-2011-02473-7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/www.ams.org\/mcom\/2012-81-277\/S0025-5718-2011-02473-7\/S0025-5718-2011-02473-7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T17:03:49Z","timestamp":1776791029000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2012-81-277\/S0025-5718-2011-02473-7\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,21]]},"references-count":30,"journal-issue":{"issue":"277","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["S0025-5718-2011-02473-7"],"URL":"https:\/\/doi.org\/10.1090\/s0025-5718-2011-02473-7","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2011,6,21]]}}}