Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2019
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/1911.11246 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917615173107712 |
|---|---|
| author | Jedwab, Jonathan |
| author_facet | Jedwab, Jonathan |
| contents | The merit factor of a $\{-1, 1\}$ binary sequence measures the collective smallness of its non-trivial aperiodic autocorrelations. Binary sequences with large merit factor are important in digital communications because they allow the efficient separation of signals from noise. It is a longstanding open question whether the maximum merit factor is asymptotically unbounded and, if so, what is its limiting value. Attempts to answer this question over almost sixty years have identified certain classes of binary sequences as particularly important: skew-symmetric sequences, symmetric sequences, and anti-symmetric sequences. Using only elementary methods, we find an exact formula for the mean and variance of the reciprocal merit factor of sequences in each of these classes, and in the class of all binary sequences. This provides a much deeper understanding of the distribution of the merit factor in these four classes than was previously available. A consequence is that, for each of the four classes, the merit factor of a sequence drawn uniformly at random from the class converges in probability to a constant as the sequence length increases. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1911_11246 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | The mean and variance of the reciprocal merit factor of four classes of binary sequences Jedwab, Jonathan Number Theory Information Theory The merit factor of a $\{-1, 1\}$ binary sequence measures the collective smallness of its non-trivial aperiodic autocorrelations. Binary sequences with large merit factor are important in digital communications because they allow the efficient separation of signals from noise. It is a longstanding open question whether the maximum merit factor is asymptotically unbounded and, if so, what is its limiting value. Attempts to answer this question over almost sixty years have identified certain classes of binary sequences as particularly important: skew-symmetric sequences, symmetric sequences, and anti-symmetric sequences. Using only elementary methods, we find an exact formula for the mean and variance of the reciprocal merit factor of sequences in each of these classes, and in the class of all binary sequences. This provides a much deeper understanding of the distribution of the merit factor in these four classes than was previously available. A consequence is that, for each of the four classes, the merit factor of a sequence drawn uniformly at random from the class converges in probability to a constant as the sequence length increases. |
| title | The mean and variance of the reciprocal merit factor of four classes of binary sequences |
| topic | Number Theory Information Theory |
| url | https://arxiv.org/abs/1911.11246 |