{"title":"The lexicographically least de Bruijn cycle","authors":"Harold Fredricksen","doi":"10.1016/S0021-9800(70)80050-3","DOIUrl":null,"url":null,"abstract":"<div><p>We investigate Ford's method for generating a de Bruijn cycle of degree <em>n</em>. We show that the feedback function which generates the cycle has the minimum possible number of positions equal to 1 and we give an algorithm which finds those positions for all <em>n</em>.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"9 1","pages":"Pages 1-5"},"PeriodicalIF":0.0000,"publicationDate":"1970-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80050-3","citationCount":"30","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980070800503","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 30
Abstract
We investigate Ford's method for generating a de Bruijn cycle of degree n. We show that the feedback function which generates the cycle has the minimum possible number of positions equal to 1 and we give an algorithm which finds those positions for all n.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
