Efficiency of sequence synthesis methods with the «not more than one coincidence» property

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...

Full description

Bibliographic Details
Main Authors: Nevrev A. I., Galchenkov O. N.
Format: Article
Language:English
Published: Politehperiodika 2016-05-01
Series:Tekhnologiya i Konstruirovanie v Elektronnoi Apparature
Subjects:
Online Access:http://tkea.com.ua/tkea/2016/2-3_2016/pdf/06.pdf
id doaj-b9fc8a47bd7d41259e3e4a6cd7f98c75
record_format Article
spelling doaj-b9fc8a47bd7d41259e3e4a6cd7f98c752020-11-24T22:02:32ZengPolitehperiodikaTekhnologiya i Konstruirovanie v Elektronnoi Apparature2225-58182309-99922016-05-012-3333610.15222/TKEA2016.2-3.33Efficiency of sequence synthesis methods with the «not more than one coincidence» propertyNevrev A. I.0Galchenkov O. N. 1Ukraine, Odessa National Polytechnic UniversityUkraine, Odessa National Polytechnic UniversityThe 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. http://tkea.com.ua/tkea/2016/2-3_2016/pdf/06.pdfbinary sequencessequences with «not more than one coincidence»lower bound sequence length estimateGalois fields
collection DOAJ
language English
format Article
sources DOAJ
author Nevrev A. I.
Galchenkov O. N.
spellingShingle Nevrev A. I.
Galchenkov O. N.
Efficiency of sequence synthesis methods with the «not more than one coincidence» property
Tekhnologiya i Konstruirovanie v Elektronnoi Apparature
binary sequences
sequences with «not more than one coincidence»
lower bound sequence length estimate
Galois fields
author_facet Nevrev A. I.
Galchenkov O. N.
author_sort Nevrev A. I.
title Efficiency of sequence synthesis methods with the «not more than one coincidence» property
title_short Efficiency of sequence synthesis methods with the «not more than one coincidence» property
title_full Efficiency of sequence synthesis methods with the «not more than one coincidence» property
title_fullStr Efficiency of sequence synthesis methods with the «not more than one coincidence» property
title_full_unstemmed Efficiency of sequence synthesis methods with the «not more than one coincidence» property
title_sort efficiency of sequence synthesis methods with the «not more than one coincidence» property
publisher Politehperiodika
series Tekhnologiya i Konstruirovanie v Elektronnoi Apparature
issn 2225-5818
2309-9992
publishDate 2016-05-01
description 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.
topic binary sequences
sequences with «not more than one coincidence»
lower bound sequence length estimate
Galois fields
url http://tkea.com.ua/tkea/2016/2-3_2016/pdf/06.pdf
work_keys_str_mv AT nevrevai efficiencyofsequencesynthesismethodswiththenotmorethanonecoincidenceproperty
AT galchenkovon efficiencyofsequencesynthesismethodswiththenotmorethanonecoincidenceproperty
_version_ 1725835308590694400