On the linear complexity of nonlinearly filtered pn-sequences

From MaRDI portal
Publication:3547152

DOI10.1109/TIT.2003.818400zbMATH Open1301.94099OpenAlexW2130257933MaRDI QIDQ3547152FDOQ3547152


Authors: Nicholas Kolokotronis, N. Kalouptsidis Edit this on Wikidata


Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2003.818400




Recommendations




Cited In (27)





This page was built for publication: On the linear complexity of nonlinearly filtered pn-sequences

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