<?xml version="1.0" encoding="UTF-8"?>

<?xml-stylesheet type="text/xsl" href="/static/oaitohtml.xsl"?>

<!--
<?xml-stylesheet type="text/xsl" href="/oaitohtml.xsl"?>
-->

<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
    <responseDate>2026-10-13T00:37:41Z</responseDate>
    <request verb="GetRecord" metadataPrefix="oai_dc" identifier="10.57760/sciencedb.43841" >https://www.scidb.cn/oai</request>
<GetRecord>
    <record>
    <header >
    <identifier>10.57760/sciencedb.43841</identifier>
    <datestamp>2026-07-28T17:19:19Z</datestamp>
</header>
    <metadata>
        
<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:date>2026-07-28</dc:date>
  <dc:title>A Dataset of Optimal and Perfect Interval Sequences for Chinese Circular Rulers (Cyclic Golomb Rulers): An Independent Discovery up to 158 Intervals</dc:title>
  <dc:identifier>doi:10.57760/sciencedb.43841</dc:identifier>
  <dc:language>en</dc:language>
  <dc:description>A Cyclic Golomb ruler (Chinese circular ruler) is a distance-measuring structure under modular arithmetic, where n marks are placed on a circle such that all clockwise distances between marks are distinct. A perfect ruler covers all integers from 1 to the ruler length L, while an optimal ruler covers the maximum possible set of consecutive integers. The author independently discovered and named this concept &amp;quot;Chinese circular ruler&amp;quot; over a decade ago while training students' thinking skills, and later learned that it had been previously studied internationally as &amp;quot;cyclic Golomb ruler.&amp;quot; This dataset contains 199 optimal and perfect Chinese circular rulers computed by the author's self-developed program, with the largest number of intervals reaching 158, far exceeding the existing OEIS record of 18 intervals. Each entry provides the interval sequence, ruler length, and computation time. For certain orders (e.g., 7, 11, 13), perfect rulers are proven nonexistent, and only optimal rulers exist. All data have been verified against the internationally recognized OEIS sequences A004136 (shortest length) and A058241 (number of optimal rulers). This dataset can be directly used by researchers in combinatorics, coding theory, and communication systems, and serves as a benchmark for the design and verification of related algorithms.</dc:description>
  <dc:subject>Chinese circular ruler; cyclic Golomb ruler; optimal ruler; perfect ruler; interval sequence; modular distance; independent discovery; OEIS A004136</dc:subject>
  <dc:creator>ceng fei ge</dc:creator>
  <dc:rights>PUBLIC</dc:rights>
  <dc:rights>https://creativecommons.org/licenses/by/4.0/</dc:rights>
  <dc:type>dataset</dc:type>
  <dc:publisher>Science Data Bank</dc:publisher>
</oai_dc:dc>

    </metadata>
</record>
</GetRecord>
</OAI-PMH>