Some notes on the binary sequences of length 2n-1 with the run property

Gangsan Kim, Min Hyung Lee, Hong Yeop Song

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publication2019 9th International Workshop on Signal Design and its Applications in Communications, IWSDA 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728116693
DOIs
Publication statusPublished - 2019 Oct
Event9th International Workshop on Signal Design and its Applications in Communications, IWSDA 2019 - Dongguan, China
Duration: 2019 Oct 202019 Oct 24

Publication series

Name2019 9th International Workshop on Signal Design and its Applications in Communications, IWSDA 2019

Conference

Conference9th International Workshop on Signal Design and its Applications in Communications, IWSDA 2019
CountryChina
CityDongguan
Period19/10/2019/10/24

Bibliographical note

Funding Information:
This work was supported by the National Research Foundation of Korea Grant through the Korea Government (MSIP) under Grant 2017R1A2B4011191.

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Signal Processing

Fingerprint Dive into the research topics of 'Some notes on the binary sequences of length 2<sup>n</sup>-1 with the run property'. Together they form a unique fingerprint.

Cite this