Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes

by   Chenyang Zhang, et al.

Hopping cyclic codes (HCCs) are (non-linear) cyclic codes with the additional property that the n cyclic shifts of every given codeword are all distinct, where n is the code length. Constant weight binary hopping cyclic codes are also known as optical orthogonal codes (OOCs). HCCs and OOCs have various practical applications and have been studied extensively over the years. The main concern of this paper is to present improved Gilbert-Varshamov type lower bounds for these codes, when the minimum distance is bounded below by a linear factor of the code length. For HCCs, we improve the previously best known lower bound of Niu, Xing, and Yuan by a linear factor of the code length. For OOCs, we improve the previously best known lower bound of Chung, Salehi, and Wei, and Yang and Fuja by a quadratic factor of the code length. As by-products, we also provide improved lower bounds for frequency hopping sequences sets and error-correcting weakly mutually uncorrelated codes. Our proofs are based on tools from probability theory and graph theory, in particular the McDiarmid's inequality on the concentration of Lipschitz functions and the independence number of locally sparse graphs.


page 1

page 2

page 3

page 4


The largest number of weights in cyclic codes

Upper and lower bounds on the largest number of weights in a cyclic code...

Construction of quaternary Hermitian LCD codes

We introduce a general construction of many Hermitian LCD [n, k] codes f...

Hulls of Cyclic Codes over Z_4

The hulls of linear and cyclic codes over finite fields have been of int...

Four infinite families of ternary cyclic codes with a square-root-like lower bound

Cyclic codes are an interesting type of linear codes and have wide appli...

Derandomizing Codes for the Binary Adversarial Wiretap Channel of Type II

We revisit the binary adversarial wiretap channel (AWTC) of type II in w...

Maximum w-cyclic holely group divisible packings with block size three and applications to optical orthogonal codes

In this paper we investigate combinatorial constructions for w-cyclic ho...

A note on small weight codewords of projective geometric codes and on the smallest sets of even type

In this paper, we study the codes 𝒞_k(n,q) arising from the incidence of...

Please sign up or login with your details

Forgot password? Click here to reset