{"title":"关于长度为2n - 1的二进制序列的运行性质的一些注意事项","authors":"Gangsan Kim, Min Hyung Lee, Hong‐Yeop Song","doi":"10.1109/IWSDA46143.2019.8966121","DOIUrl":null,"url":null,"abstract":"In this paper, we calculate the number of binary sequences of length 2n – 1 that satisfy the run property, called run sequences. We know that only a small portion of those run sequences satisfy the span property. In this paper, in addition, we present some interesting properties of those run sequences with or without the span property.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Some notes on the binary sequences of length 2n – 1 with the run property\",\"authors\":\"Gangsan Kim, Min Hyung Lee, Hong‐Yeop Song\",\"doi\":\"10.1109/IWSDA46143.2019.8966121\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we calculate the number of binary sequences of length 2n – 1 that satisfy the run property, called run sequences. We know that only a small portion of those run sequences satisfy the span property. In this paper, in addition, we present some interesting properties of those run sequences with or without the span property.\",\"PeriodicalId\":326214,\"journal\":{\"name\":\"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWSDA46143.2019.8966121\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSDA46143.2019.8966121","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Some notes on the binary sequences of length 2n – 1 with the run property
In this paper, we calculate the number of binary sequences of length 2n – 1 that satisfy the run property, called run sequences. We know that only a small portion of those run sequences satisfy the span property. In this paper, in addition, we present some interesting properties of those run sequences with or without the span property.