A method of optimisation of the exhaustive computer search for perfect sequences

DOI10.1007/978-3-319-12325-7_7MaRDI QIDQ2945069zbMATH OpenOpenAlexFDO

Authors O. P. Kuznetsov

Publication date 9 September 2015

Published in Sequences and Their Applications - SETA 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-12325-7_7

zbMATH Keywords

left perfectperfect sequencequaternionright perfect

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• A method of constructing a quaternion perfect sequence using composition of sequences of even lengths
• Perfect Sequences of Unbounded Lengths over the Basic Quaternions
• Exhaustive search for low-autocorrelation binary sequences
• The synthesis of perfect sequences
• scientific article; zbMATH DE number 1498806

Cited in

(1)

• A method of constructing a quaternion perfect sequence using composition of sequences of even lengths

This page was built for publication: A method of optimisation of the exhaustive computer search for perfect sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945069)