• Title/Summary/Keyword: generalized bent sequences

Search Result 3, Processing Time 0.015 seconds

New Constructions of p-ary Bent Sequences (새로운 p진 Bent 수열의 생성)

  • 김영식;장지웅;노종선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.10C
    • /
    • pp.930-935
    • /
    • 2003
  • In this paper, using bent functions defined [n the finite field we generalized the construction method of the family of p-ary bent sequences with balanced and optimal correlation property introduced by Kumar and Moreno for an odd prime p[3], called a generalized p-ary bent sequence. It turns out that the family of balanced p-ary sequences with optimal correlation property introduced by Moriuchi and Imamura [6] is a special case of the generalized p-ary bent sequences.

Generalized Binary Bent Sequences (일반화된 이진 Bent 시퀀스)

  • Gil, Gang-Mi;No, Jong-Seon;Shin, Dong-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.1A
    • /
    • pp.35-41
    • /
    • 2002
  • In this paper, we generalize the family of binary bent sequences introduced by Olsen, Scholtz and Welch [2] to obtain the generalized binary bent sequences with optimal correlation and balance properties. The modified trace transform is introduced and it enables us to use linear function from ${F_{2^n}}$ to the intermediate field ${F_{2^e}}$, where e|n. If we choose e=1, our method becomes the conventional binary bent sequence case. Also, some examples are given which show that our construction gives the family of simple binary sequences with optimal correlation and balance properties.

A Study on the Generating Algorithm and the Correlation Function of Kumar Code Sequences for the Frequency Hopping Patterns (주파수 경로 패턴을 위한 Kumar 부호계열 발생 알고리즘 및 상관함수 특성에 관한 연구)

  • 이정재;한영렬
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.12
    • /
    • pp.1886-1902
    • /
    • 1989
  • In this paper we discuss the generating algorithm of Kumar code sequences which are based on generalized bent sequences for FH-CDMA. The code sequence generator was constructed for the shift register stages n=4 over GF (5). Finally we analyze the characteristics fo Hamming correlation between two code sequences and the time-frequency correlatins of the complete waveform with the sinusoidal chips as the elemental waveforms.

  • PDF