#### Filter Results:

- Full text PDF available (19)

#### Publication Year

2004

2012

- This year (0)
- Last 5 years (1)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Young-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung
- IEEE Trans. Information Theory
- 2008

- Young-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung
- IEEE Transactions on Information Theory
- 2005

For a prime p and positive integers M and n such that M|p/sup n/-1, Sidel'nikov introduced M-ary sequences (called Sidel'nikov sequences) of period p/sup n/-1, the out-of-phase autocorrelation magnitude of which is upper bounded by 4. In this correspondence, we derived the autocorrelation distributions, i.e., the values and the number of occurrences of each… (More)

- Young-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung
- Proceedings. International Symposium on…
- 2005

In this paper, we derive linear complexity over F<sub>p</sub> of the M-ary Sidel'nikov sequences using discrete Fourier transform. As an example, we represent the linear complexity of the ternary Sidel'nikov sequences. It turned out that the ternary Sidel'nikov sequences have the linear complexity nearly close to their periods

- Beomkyu Shin, Changkyu Seol, Jung-Soo Chung, Jun Jin Kong
- ISCAS
- 2012

- Young-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung
- SETA
- 2006

In this paper, for positive integers m, M , and a prime p such that M |p m − 1, we derive linear complexity over the prime field Fp of M-ary Sidel'nikov sequences of period p m −1 using discrete Fourier transform. As a special case, the linear complexity of the ternary Sidel'nikov sequence is presented. It turns out that the linear complexity of a ternary… (More)

- Jung-Soo Chung, Jong-Seon No, Habong Chung
- IEEE Transactions on Information Theory
- 2011

In this paper, a new family of <i>M</i> -ary sequences of period <i>p</i><sup>n</sup> -1 is proposed. The proposed family is constructed by the addition of cyclic shifts of an <i>M</i> -ary Sidel'nikov sequence and its reverse sequence. The number of sequences contained in this family is about (<i>M</i>-1)<sup>2</sup> times of their period and the maximum… (More)

— In this paper, we derive the cyclotomic numbers of order 5 over an extension field Fpn using the well-known results of quintic Jacobi sums over Fp [1]. For p ≡ 1 mod 5, we have obtained the simple closed-form expression of the cyclotomic numbers of order 5 over Fpn. For p ≡ 1 mod 5, we express the cyclotomic number of order 5 over Fpn in terms of the… (More)

- Jung-Soo Chung, Jong-Seon No, Habong Chung
- IEEE Trans. Information Theory
- 2011

—In this paper, a new family of-ary sequences of period 1 is proposed. The proposed family is constructed by the addition of cyclic shifts of an-ary Sidel'nikov sequence and its reverse sequence. The number of sequences contained in this family is about (1) 2 times of their period and the maximum magnitude of their correlation values is upper bounded by 4 +… (More)

- Jung-Soo Chung, Young-Sik Kim, Tae-Hyung Lim, Jong-Seon No, Habong Chung
- IEICE Transactions
- 2009

In this paper, for a prime p and a positive integer q such that q|p n − 1, we constructed q-ary Lempel– Cohn–Eastman(LCE) sequences with period p n − 1. These sequences have maximum autocorrelation magnitude bounded by 4. Particularly, in the case of q = 3, the maximum autocorrelation magnitude of the ternary LCE sequences is 3. And the maximum… (More)