2022-01-28T02:30:47Zhttps://tsukuba.repo.nii.ac.jp/oaioai:tsukuba.repo.nii.ac.jp:000294962021-03-01T18:37:46ZRedundancy-Optimal FF Codes for a General Source and Its Relationships to the Rate-Optimal FF Codes古賀, 弘樹ARIMURA, MitsuharuKOGA, HirokiIWATA, Ken-ichi© 2013 The Institute of Electronics, Information and Communication EngineersIn this paper we consider fixed-to-fixed length (FF) coding of a general source X with vanishing error probability and define two kinds of optimalities with respect to the coding rate and the redundancy, where the redundancy is defined as the difference between the coding rate and the symbolwise ideal codeword length. We first show that the infimum achievable redundancy coincides with the asymptotic width W(X) of the entropy spectrum. Next, we consider the two sets $\mCH(\bX)$ and $\mCW(\bX)$ and investigate relationships between them, where $\mCH(\bX)$ and $\mCW(\bX)$ denote the sets of all the optimal FF codes with respect to the coding rate and the redundancy, respectively. We give two necessary and sufficient conditions corresponding to $\mCH(\bX) \subseteq \mCW(\bX)$ and $\mCW(\bX) \subseteq \mCH(\bX)$, respectively. We can also show the existence of an FF code that is optimal with respect to both the redundancy and the coding rate.電子情報通信学会2013-12engjournal articlehttp://hdl.handle.net/2241/120697https://tsukuba.repo.nii.ac.jp/records/2949610.1587/transfun.E96.A.2332http://www.ieice.org/jpn/trans_online/index.html0916-8508AA10826239IEICE transactions on fundamentals of electronics, communications and computer sciencesE96.A1223322342https://tsukuba.repo.nii.ac.jp/record/29496/files/IEICETC_E96A-12-2332.pdfapplication/pdf675.9 kB2014-05-09