Learn More
Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of p-ary linear codes with two or three weights are constructed from quadratic Bent functions over the finite field Fp, where p is an odd prime. They include some earlier linear codes as(More)
The theory of cyclotomy dates back to Gauss and has a number of applications in combinatorics, coding theory, and cryptography. Cyclotomy over a residue class ring \BBZv can be divided into classical cyclotomy or generalized cyclotomy, depending on v prime or composite. In this paper, we introduce a generalized cyclotomy of order d over(More)
Reed-Solomon codes, a type of BCH codes, are widely employed in communication systems, storage devices and consumer electronics. This fact demonstrates the importance of BCH codes – a family of cyclic codes – in practice. In theory, BCH codes are among the best cyclic codes in terms of their error-correcting capability. A subclass of BCH codes are the(More)
Frequency-hopping sequences (FHSs) with favorable partial Hamming correlation properties have important applications in many synchronization and multiple-access systems. Strictly optimal FHSs are those FHSs with optimal partial Hamming autocorrelation irrespective of the correlation window length. In this paper, strictly optimal FHSs are investigated from a(More)
Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a construction of q-ary linear codes with few weights employing general quadratic forms over the finite field F q ${\mathbb {F}}_{q}$ is proposed, where q is an odd prime power. This generalizes some(More)
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Let m = 2l+1 for an integer l≥ 1 and π be a generator of GF(3m)∗. In this paper, a class of cyclic codes C(u,v) over GF(3) with two nonzeros πu and πv is studied,(More)
We present unified constructions of optical orthogonal codes (OOCs) using other combinatorial objects such as cyclic linear codes and frequency hopping sequences. Some of obtained OOCs are optimal or asymptotically optimal with respect to the Johnson bound. Also, we are able to show the existence of new optimal frequency hopping sequences (FHSs) with(More)
Binary sequences with optimal autocorrelation play important roles in radar, communication, and cryptography. Finding new binary sequences with optimal autocorrelation has been an interesting research topic in sequence design. Ding-Helleseth-Lam sequences are such a class of binary sequences of period p, where p is an odd prime with p ≡ 1(mod 4). The(More)