Please use this identifier to cite or link to this item:
Title: Improved p-ary codes and sequence families from Galois rings
Authors: Ling, S. 
Özbudak, F.
Issue Date: 2005
Citation: Ling, S.,Özbudak, F. (2005). Improved p-ary codes and sequence families from Galois rings. Lecture Notes in Computer Science 3486 : 236-242. ScholarBank@NUS Repository.
Abstract: In this paper, a recent bound on some Well-type exponential sums over Galois rings is used in the construction of codes and sequences. The bound on these type of exponential sums provides a lower bound for the minimum distance of a family of codes over double-struck F signp, mostly nonlinear, of length pm+1 and size p2 · p m(D-⌊D/p2⌋), where 1 ≤ D ≤ pm/2. Several families of pairwise cyclically distinct p-ary sequences of period p(pm - 1) of low correlation are also constructed. They compare favorably with certain known p-ary sequences of period pm- 1. Even in the case p = 2, one of these families is slightly larger than the family Q(D) of [H-K, Section 8.8], while they share the same period and the same bound for the maximum non-trivial correlation. © Springer-Verlag Berlin Heidelberg 2005.
Source Title: Lecture Notes in Computer Science
ISSN: 03029743
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Nov 2, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.