The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Saved in:

Bibliographic Details
Main Authors:	Fu, F.-W., Niederreiter, H., Su, M.
Other Authors:	TEMASEK LABORATORIES
Format:	Conference or Workshop Item
Published:	2014
Subjects:	Counting function Fast algorithms k-Error linear complexity Linear complexity Periodic sequences Stream cipher systems
Online Access:	http://scholarbank.nus.edu.sg/handle/10635/111649
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	National University of Singapore

id	sg-nus-scholar.10635-111649
record_format	dspace
spelling	sg-nus-scholar.10635-1116492015-01-14T10:43:33Z The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity Fu, F.-W. Niederreiter, H. Su, M. TEMASEK LABORATORIES MATHEMATICS Counting function Fast algorithms k-Error linear complexity Linear complexity Periodic sequences Stream cipher systems Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4086 LNCS 88-103 2014-11-28T01:54:38Z 2014-11-28T01:54:38Z 2006 Conference Paper Fu, F.-W.,Niederreiter, H.,Su, M. (2006). The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4086 LNCS : 88-103. ScholarBank@NUS Repository. 3540445234 03029743 http://scholarbank.nus.edu.sg/handle/10635/111649 NOT_IN_WOS Scopus
institution	National University of Singapore
building	NUS Library
country	Singapore
collection	ScholarBank@NUS
topic	Counting function Fast algorithms k-Error linear complexity Linear complexity Periodic sequences Stream cipher systems
spellingShingle	Counting function Fast algorithms k-Error linear complexity Linear complexity Periodic sequences Stream cipher systems Fu, F.-W. Niederreiter, H. Su, M. The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity
description	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
author2	TEMASEK LABORATORIES
author_facet	TEMASEK LABORATORIES Fu, F.-W. Niederreiter, H. Su, M.
format	Conference or Workshop Item
author	Fu, F.-W. Niederreiter, H. Su, M.
author_sort	Fu, F.-W.
title	The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity
title_short	The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity
title_full	The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity
title_fullStr	The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity
title_full_unstemmed	The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity
title_sort	characterization of 2n-periodic binary sequences with fixed 1-error linear complexity
publishDate	2014
url	http://scholarbank.nus.edu.sg/handle/10635/111649
_version_	1681094344679882752

The characterization of 2n-periodic binary sequences with fixed 1-error linear complexity

Similar Items