MINIMUM DISTANCE OF LOGARITHMIC AND FRACTIONAL PARTIAL M-SEQUENCES

被引：11

作者：

KUMAR, PV ^{[1
]}

WEI, VK ^{[1
]}

机构：

[1] BELL COMMUN RES INC,MORRISTOWN,NJ 07960

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1992年 / 38卷 / 05期

关键词：

M-SEQUENCE; PARTIAL-PERIOD; MINIMUM DISTANCE; PARTIAL-PERIOD CORRELATION;

D O I：

10.1109/18.149498

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Two results are presented concerning the partial-periods (p-p's) of an m-sequence of period 2n - 1. The first proves the existence of an m-sequence whose p-p's of length approximately (n + d log 2 (n)) have minimum distance between d and 2d for small d. The second result is of an asymptotic nature and proves that the normalized minimum distance of p-p's whose length is any fraction of the period of the m-sequence, approaches 1/2 as the period of the m-sequence tends to infinity.

引用

页码：1474 / 1482

页数：9

共 13 条

[1]

BARTEE TC, 1963, 318 TECH REP

[2]

Bekir N. E, 1978, THESIS U SO CALIFORN

[3]

BERLEKAMP ER, 1968, ALGEBRAIC CODING THE

[4] PSEUDO-RANDOMNESS PROPERTIES OF BINARY SHIFT REGISTER SEQUENCES [J].