A simple method to estimate the maximum nontrivial correlation of some sets of sequences (Q1320445): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01438281 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057839539 / rank | |||
Normal rank | |||
Latest revision as of 10:52, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple method to estimate the maximum nontrivial correlation of some sets of sequences |
scientific article |
Statements
A simple method to estimate the maximum nontrivial correlation of some sets of sequences (English)
0 references
13 February 1995
0 references
The authors estimate the moduli of certain character sums by a method of \textit{V. M. Sidel'nikov} [Probl. Kibern. 42, 15-24 (1971; Zbl 0241.94009)] and use their results to estimate the maximum nontrivial correlations of several well-known sets of sequences.
0 references
correlation of binary sequences
0 references
moduli of certain characters
0 references
