Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A fast algorithm for determining the linear complexity of a binary sequence with period \(2^np^m\) - MaRDI portal

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



zbMATH Keywords

No records found.


Mathematics Subject Classification ID

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)

Retrieved from "https://mardi.schubotz.org/w/index.php?title=Publication:865964&oldid=12812088"
Powered by MediaWiki