Improved binary codes and sequence families from Z4-linear codes

Shanbhag, A. G. ; Vijay Kumar, P. ; Hellesath, T. (1996) Improved binary codes and sequence families from Z4-linear codes IEEE Transactions on Information Theory, 42 (5). pp. 1582-1587. ISSN 0018-9448

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/document/532904/

Related URL: http://dx.doi.org/10.1109/18.532904

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.

Item Type:Article
Source:Copyright of this article belongs to Institute of Electrical and Electronic Engineers.
ID Code:110336
Deposited On:31 Jan 2018 10:43
Last Modified:31 Jan 2018 10:43

Repository Staff Only: item control page