A fast algorithm for determining the linear complexity of a binary sequence with period \(2^np^m\)
From MaRDI portal
Publication:865964
DOI10.1007/BF02713949zbMATH Open1125.94319OpenAlexW2283182377MaRDI QIDQ865964
Author name not available (Why is that?)
Publication date: 20 February 2007
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02713949
No records found.
No records found.
This page was built for publication: A fast algorithm for determining the linear complexity of a binary sequence with period \(2^np^m\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q865964)
