Old Web
English
Sign In
Acemap
>
Paper
>
Asymptotic Tightness of The Shannon Lower Bound for R(D) -- Another Proof for Self-Similar Memoryless Source
Asymptotic Tightness of The Shannon Lower Bound for R(D) -- Another Proof for Self-Similar Memoryless Source
2017
Taguchi Shingo
Kawabata Tsutomu
Keywords:
Combinatorics
Rate–distortion theory
Mathematical analysis
Mathematics
Singular distribution
Upper and lower bounds
Shannon's source coding theorem
Discrete mathematics
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]