scientific article; zbMATH DE number 2154111
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].
- On binary cyclic codes with codewords of weight three and binary sequences with the trinomial property
- A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions
- Periodic binary sequences with the "trinomial property"
- Binary cyclic codes from trinomials over GF(2ᵐ)
- Cyclic codes from some monomials and trinomials
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4664660)