The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation

From MaRDI portal
Publication:894464

DOI10.1016/J.IPL.2015.09.007zbMATH Open1350.94026OpenAlexW1796785622MaRDI QIDQ894464FDOQ894464


Authors: A. Palvinskiy, Vladimir Edemskiy Edit this on Wikidata


Publication date: 1 December 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.09.007




Recommendations




Cites Work


Cited In (6)





This page was built for publication: The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation

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