No label defined (Q4664660)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2154111
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2154111 |
Statements
8 April 2005
0 references
binary cyclic code
0 references
binary sequences with the trinomial property
0 references
0.9583142995834352
0 references
0.9574316143989564
0 references
0.8332230448722839
0 references
0.81126469373703
0 references
0.8081251382827759
0 references
A binary sequence \(\mathbf{a}=(a_0,a_1,\dots,a_{n-1})\) of length \(n=2^m -1\) has the trinomial property if there is at least one pair of positive integers \(k\) and \(l\), \(0<k<l<n\), such that \(a_i + a_{i+k} + a_{i+l}=0\) for all \(i\in\{0,1,\dots,n-1\}\), where the indices are taken modulo \(n\). A set of such sequences is closely connected with binary cyclic codes of code distance three. \textit{S. Golomb} and \textit{G. Gong} [IEEE Trans. Inf. Theory 45, 1276--1279 (1999; Zbl 0957.94022)] conjectured that, when \(m\) is prime, any nonlinear binary sequence of period \(n=2^m -1\) has no trinomial pairs, which means that there are no binary cyclic codes of length \(n=2^m -1\) with minimum distance three. In the article under review it is proven that the conjecture is false for \(m\geq 17\). An infinite class of binary cyclic codes with minimum distance exactly 4 is presented, which means that the corresponding sequences \(\mathbf{c}\) satisfy the relation \(c_i+c_{i+j}+c_{i+k}+c_{i+l}=0\) but violate the trinomial property. For the entire collection see [Zbl 0944.00096].
0 references