Title :
Improved binary codes and sequence families from Z4-linear codes
Author :
Shanbhag, Abhijit G. ; Kumar, P. Vijay ; Hellesath, T.
Author_Institution :
Commun. Sci. Inst., Univ. of Southern California, Los Angeles, CA, USA
fDate :
9/1/1996 12:00:00 AM
Abstract :
A bound on exponential sums over Galois rings is used to construct a nested chain of Z4-linear binary codes and binary sequences. When compared with the chain of Delsarte-Goethals´(1975) codes, the codes in the new chain offer a larger minimum distance for the same code size. The binary sequence families constructed also make use of Nechaev´s (1991) construction of a cyclic version of the Kerdock code. For a given value of maximum correlation, the binary sequences are shown to have a family size considerably larger than the best sequence families known
Keywords :
binary sequences; correlation methods; cyclic codes; linear codes; Galois rings; Kerdock code; Z4-linear codes; binary codes; binary sequence families; code size; cyclic codes; exponential sums bound; family size; maximum correlation; minimum distance; nested chain; Binary codes; Binary sequences; Councils; Gold; Informatics; Information theory; Multiaccess communication;
Journal_Title :
Information Theory, IEEE Transactions on
