Open AccessEfficiency of sequence synthesis methods with the «not more than one coincidence» property
Author(s) -
Alexander Nevrev,
О Н Галчёнков,
Alexander Nevrev,
O N Galchenkov
Publication year - 2016
Publication title -
tehnologiâ i konstruirovanie v èlektronnoj apparature
Language(s) - English
Resource type - Journals
eISSN - 2309-9992
pISSN - 2225-5818
DOI - 10.15222/tkea2016.2-3.33
Subject(s) - coincidence , binary number , property (philosophy) , sequence (biology) , mathematics , upper and lower bounds , expression (computer science) , algorithm , computer science , mathematical analysis , arithmetic , chemistry , medicine , philosophy , biochemistry , alternative medicine , epistemology , pathology , programming language
The author presents an expression for determining the minimum possible length of binary sequences with «not more than one coincidence» property. Obtained low bound length value allows quantitatively estimating efficiency of any known synthesis methods for creation of binary sequences with «not more than one coincidence» property. The efficiency of known methods of creating binary sequences based on extended Galois fields theory is analyzed by comparing the obtained sequences length with a theoretical low bound estimation. The paper shows high performance of the known methods of creation of sequences with «not more than one coincidence» property based on extended Galois fields.