Trace Representation of Legendre Sequences

Jeong Heon Kim, Hong-Yeop Song

Research output: Contribution to journalArticle

31 Citations (Scopus)

Abstract

In this paper, a Legendre sequence of period p for any odd prime p is explicitely represented as a sum of trace functions from GF(2n) to G F(2), where n is the order of 2 mod p.

Original languageEnglish
Pages (from-to)343-348
Number of pages6
JournalDesigns, Codes, and Cryptography
Volume24
Issue number3
DOIs
Publication statusPublished - 2001 Dec 1

Fingerprint

Trace Function
Legendre
Odd
Trace

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Theoretical Computer Science

Cite this

Kim, Jeong Heon ; Song, Hong-Yeop. / Trace Representation of Legendre Sequences. In: Designs, Codes, and Cryptography. 2001 ; Vol. 24, No. 3. pp. 343-348.
@article{99e1302e42a440ee950b23e998040189,
title = "Trace Representation of Legendre Sequences",
abstract = "In this paper, a Legendre sequence of period p for any odd prime p is explicitely represented as a sum of trace functions from GF(2n) to G F(2), where n is the order of 2 mod p.",
author = "Kim, {Jeong Heon} and Hong-Yeop Song",
year = "2001",
month = "12",
day = "1",
doi = "10.1023/A:1011287607979",
language = "English",
volume = "24",
pages = "343--348",
journal = "Designs, Codes, and Cryptography",
issn = "0925-1022",
publisher = "Springer Netherlands",
number = "3",

}

Trace Representation of Legendre Sequences. / Kim, Jeong Heon; Song, Hong-Yeop.

In: Designs, Codes, and Cryptography, Vol. 24, No. 3, 01.12.2001, p. 343-348.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Trace Representation of Legendre Sequences

AU - Kim, Jeong Heon

AU - Song, Hong-Yeop

PY - 2001/12/1

Y1 - 2001/12/1

N2 - In this paper, a Legendre sequence of period p for any odd prime p is explicitely represented as a sum of trace functions from GF(2n) to G F(2), where n is the order of 2 mod p.

AB - In this paper, a Legendre sequence of period p for any odd prime p is explicitely represented as a sum of trace functions from GF(2n) to G F(2), where n is the order of 2 mod p.

UR - http://www.scopus.com/inward/record.url?scp=0035546482&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035546482&partnerID=8YFLogxK

U2 - 10.1023/A:1011287607979

DO - 10.1023/A:1011287607979

M3 - Article

VL - 24

SP - 343

EP - 348

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

SN - 0925-1022

IS - 3

ER -