A Characterization of Optimal FF Coding Rate Using a New Optimistically Optimal Code | Zendy

Mitsuharu Arimura | Zendy; Hiroki Koga | Zendy; Kenichi Iwata | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Characterization of Optimal FF Coding Rate Using a New Optimistically Optimal Code

Author(s) -

Mitsuharu Arimura,

Hiroki Koga,

Kenichi Iwata

Publication year - 2013

Publication title -

ieice transactions on fundamentals of electronics communications and computer sciences

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.188

H-Index - 52

eISSN - 1745-1337

pISSN - 0916-8508

DOI - 10.1587/transfun.e96.a.2443

Subject(s) - coding (social sciences) , asymptotically optimal algorithm , variable length code , computer science , code rate , universal code , theoretical computer science , mathematics , algorithm , decoding methods , statistics , systematic code

In this letter, we first introduce a stronger notion of the optimistic achievable coding rate and discuss a coding theorem. Next, we give a necessary and sufficient condition under which the coding rates of all the optimal FF codes asymptotically converge to a constant

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research