2007Beijing Youdian Xueyuan xuebaoRequires access

Research of Almost Perfect Punctured Binary Sequence Pairs

Zheng Zhou

Open publisher page 1 citations

Abstract

A new perfect correlation signal was proposed,which can be called as almost perfect punctured binary sequence pairs.Its properties and combinatorial admissibility conditions were studied.By making use of these properties and conditions,the searching efficiency for the almost perfect punctured binary sequence pairs can be improved significantly.A computational algorithm is compiled to find out a set of almost perfect punctured binary sequence pairs.The searching results show that the existent range of almost perfect punctured binary sequence pairs is so wide that they are suitable for engineering applications.

About this research paper

What this paper is about

A new perfect correlation signal was proposed,which can be called as almost perfect punctured binary sequence pairs.Its properties and combinatorial admissibility conditions were studied.By making use of these properties and conditions,the searching efficiency for the almost perfect punctured binary sequence pairs can be improved significantly.A computational algorithm is compiled to find out a set of almost perfect punctured binary sequence pairs.The searching results show that the existent range of almost perfect punctured binary sequence pairs is so wide that they are suitable for engineering applications.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A new perfect correlation signal was proposed,which can be called as almost perfect punctured binary sequence pairs.Its properties and combinatorial admissibility conditions were studied.By making use of these properties and conditions,the searching efficiency for the almost perfect punctured binary sequence pairs can be improved significantly.A computational algorithm is compiled to find out a set of almost perfect punctured binary sequence pairs.The searching results show that the existent range of almost perfect punctured binary sequence pairs is so wide that they are suitable for engineering applications.

Key concepts: Sequence (biology), Binary number, Pseudorandom binary sequence, Set (abstract data type), Mathematics, Algorithm, Range (aeronautics), Combinatorics

Related papers

Back to paper searchBrowse research topicsOriginal source
Research of Almost Perfect Punctured Binary Sequence Pairs — Research Paper | ScholarLens