Asymptotic Gilbert-Varshamov bound on Frequency Hopping

10/28/2018
by   Xianhua Niu, et al.
0

Given a q-ary frequency hopping sequence set of length n and size M with Hamming correlation H, one can obtain a q-ary (nonlinear) cyclic code of length n and size nM with Hamming distance n-H. Thus, every upper bound on the size of a code from coding theory gives an upper bound on the size of a frequency hopping sequence set. Indeed, all upper bounds from coding theory have been converted to upper bounds on frequency hopping sequence sets (Ding09). On the other hand, a lower bound from coding theory does not automatically produce a lower bound for frequency hopping sequence sets. In particular, the most important lower bound--the Gilbert-Varshamov bound in coding theory has not been transformed to frequency hopping sequence sets. The purpose of this paper is to convert the Gilbert-Varshamov bound in coding theory to frequency hopping sequence sets by establishing a connection between a special family of cyclic codes (which are called hopping cyclic codes in this paper) and frequency hopping sequence sets. We provide two proofs of the Gilbert-Varshamov bound. One is based on probabilistic method that requires advanced tool--martingale. This proof covers the whole rate region. The other proof is purely elementary but only covers part of the rate region.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/28/2018

Asymptotic Gilbert-Varshamov bound on Frequency Hopping Sequences

Given a q-ary frequency hopping sequence set of length n and size M with...
research
03/29/2023

An Elementary Proof of the First LP Bound on the Rate of Binary Codes

The asymptotic rate vs. distance problem is a long-standing fundamental ...
research
09/10/2019

Coding for Sunflowers

A sunflower is a family of sets that have the same pairwise intersection...
research
12/07/2022

An upper bound on the number of frequency hypercubes

A frequency n-cube F^n(q;l_0,...,l_m-1) is an n-dimensional q-by-...-by-...
research
05/21/2020

On the number of frequency hypercubes F^n(4;2,2)

A frequency n-cube F^n(4;2,2) is an n-dimensional 4×⋯× 4 array filled by...
research
03/29/2021

An upper bound on the size of Sidon sets

In this entry point into the subject, combining two elementary proofs, w...
research
05/13/2019

Construction of three classes of Strictly Optimal Frequency-Hopping Sequence Sets

In this paper, we construct three classes of strictly optimal frequency-...

Please sign up or login with your details

Forgot password? Click here to reset