2003•Acta Scientiarum Naturalium Universitatis SunyatseniRequires access

PERFECT PUNCTURED BINARY SEQUENCE PAIRS

JiangTing, ZhaoXiaoqun, HouLantian

Abstract

This paper presents the definition of perfect punctured binary sequence pair and the combinatorial admissible conditions for searching the perfect punctured binary sequence pairs and proves that all of the pseudo-random binary sequences satisfy these conditions. Computer calculation verifes that the pseudo-random binary sequences with length up to N=127 can be easily turned into perfect punctured binary sequence pairs.

About this research paper

What this paper is about

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

Key concepts: Binary number, Pseudorandom binary sequence, Sequence (biology), Mathematics, Combinatorics, Random binary tree, Random sequence, Complementary sequences