Please use this identifier to cite or link to this item:
|Title:||Duadic sequences of prime lengths||Authors:||Ding, C.
|Issue Date:||2000||Citation:||Ding, C.,Helleseth, T.,Lam, K.Y. (2000). Duadic sequences of prime lengths. Discrete Mathematics 218 (1-3) : 33-49. ScholarBank@NUS Repository.||Abstract:||Legendre sequences have a number of interesting properties. Their counterparts in coding theory are binary quadratic residue codes. In this paper we study a class of binary sequences, called duadic sequences whose counterparts in coding theory are duadic codes. We calculate their linear complexity, study their autocorrelation and crosscorrelation properties, give exact formulas for the number of bigrams in a cycle, investigate their decimation properties, and discuss their implementation. © 2000 Elsevier Science B.V. All rights reserved.||Source Title:||Discrete Mathematics||URI:||http://scholarbank.nus.edu.sg/handle/10635/38915||ISSN:||0012365X|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 19, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.