搜索结果: 1-4 共查到“知识库 理学 Linear complexity over Z/m”相关记录4条 . 查询时间(0.109 秒)
Linear Complexity Lossy Compressor for Binary Redundant Memoryless Sources
nonlinear function LDGM codes lossy compression replica method
2011/8/30
Abstract: A lossy compression algorithm for binary redundant memoryless sources is presented. The proposed scheme is based on sparse graph codes. By introducing a nonlinear function, redundant memoryl...
BINARY SEQUENCE WITH PERFECT SPREADING STAIRCASE PROFILE OF LINEAR COMPLEXITY
Linear complexity pseudo-random sequenc
2007/8/7
This paper makes the following investigations. 1. To solve the second open problem proposed by M.Morii and M.Kasahar[1]; 2. To prove the nonexistence of PSSP sequence with the smallest(or biggest) den...
Let \underline{S}=(S,S,…) be a binary random sequence with period N=2~n, where S=(S_0,…,S_(N-1)) is its one period with N independent and uniformly distributed binary random variables. The main result...
LINEAR COMPLEXITY AND THE MINIMAL POLYNOMIAL OF LINEAR RECURRING SEQUENCES OVER Z/(m)
Linear complexity over Z/(m) uniqueness
2007/8/7
In this note we discuss the annihilating properties of sequences over Z/(m). By considering the linear complexity and the annihilator structure, we derive the uniqueness condition for the minimal poly...