Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences

From MaRDI portal

Revision as of 01:02, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3546748

Jump to:navigation, search

DOI10.1109/TIT.2004.836704zbMath1194.94178MaRDI QIDQ3546748

Zongduo Dai, Kyoki Imamura, Guang Gong, Shaoquan Jiang

Publication date: 21 December 2008

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

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Prefix, length-variable, comma-free codes (94A45)

Related Items (2)

The asymptotic normalized linear complexity of multisequences ⋮ Asymptotic analysis on the normalized \(k\)-error linear complexity of binary sequences

This page was built for publication: Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3546748&oldid=16927047"