國立虎尾科技大學 |

Universal Source Coding in the Non-Asymptotic Regime.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Universal Source Coding in the Non-Asymptotic Regime./
作者:	Iri, Nematollah.
面頁冊數:	1 online resource (98 pages)
附註:	Source: Dissertation Abstracts International, Volume: 79-09(E), Section: B.
Contained By:	Dissertation Abstracts International79-09B(E).
標題:	Electrical engineering. -
電子資源:	click for full text (PQDT)
ISBN:	9780355929782

Universal Source Coding in the Non-Asymptotic Regime.
Iri, Nematollah.

Universal Source Coding in the Non-Asymptotic Regime. - 1 online resource (98 pages)

Source: Dissertation Abstracts International, Volume: 79-09(E), Section: B.

Thesis (Ph.D.)--Arizona State University, 2018.

Includes bibliographical references

Fundamental limits of fixed-to-variable (F-V) and variable-to-fixed (V-F) length universal source coding at short blocklengths is characterized. For F-V length coding, the Type Size (TS) code has previously been shown to be optimal up to the third-order rate for universal compression of all memoryless sources over finite alphabets. The TS code assigns sequences ordered based on their type class sizes to binary strings ordered lexicographically.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780355929782Subjects--Topical Terms:

596380
Electrical engineering.
Index Terms--Genre/Form:

554714
Electronic books.

Universal Source Coding in the Non-Asymptotic Regime.
LDR:03227ntm a2200373Ki 4500 001 919171
005 20181116131021.5
006 m o u
007 cr mn||||a|a||
008 190606s2018 xx obm 000 0 eng d
020 $a 9780355929782
035 $a (MiAaPQ)AAI10788851
035 $a (MiAaPQ)asu:17655
035 $a AAI10788851
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Iri, Nematollah. $3 1193680
245 1 0 $a Universal Source Coding in the Non-Asymptotic Regime.
264 0 $c 2018
300 $a 1 online resource (98 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 79-09(E), Section: B.
500 $a Adviser: Oliver Kosut.
502 $a Thesis (Ph.D.)--Arizona State University, 2018.
504 $a Includes bibliographical references
520 $a Fundamental limits of fixed-to-variable (F-V) and variable-to-fixed (V-F) length universal source coding at short blocklengths is characterized. For F-V length coding, the Type Size (TS) code has previously been shown to be optimal up to the third-order rate for universal compression of all memoryless sources over finite alphabets. The TS code assigns sequences ordered based on their type class sizes to binary strings ordered lexicographically.
520 $a Universal F-V coding problem for the class of first-order stationary, irreducible and aperiodic Markov sources is first considered. Third-order coding rate of the TS code for the Markov class is derived. A converse on the third-order coding rate for the general class of F-V codes is presented which shows the optimality of the TS code for such Markov sources.
520 $a This type class approach is then generalized for compression of the parametric sources. A natural scheme is to define two sequences to be in the same type class if and only if they are equiprobable under any model in the parametric class. This natural approach, however, is shown to be suboptimal. A variation of the Type Size code is introduced, where type classes are defined based on neighborhoods of minimal sufficient statistics. Asymptotics of the overflow rate of this variation is derived and a converse result establishes its optimality up to the third-order term. These results are derived for parametric families of i.i.d. sources as well as Markov sources.
520 $a Finally, universal V-F length coding of the class of parametric sources is considered in the short blocklengths regime. The proposed dictionary which is used to parse the source output stream, consists of sequences in the boundaries of transition from low to high quantized type complexity, hence the name Type Complexity (TC) code. For large enough dictionary, the $\epsilon$-coding rate of the TC code is derived and a converse result is derived showing its optimality up to the third-order term.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Electrical engineering. $3 596380
650 4 $a Information science. $3 561178
655 7 $a Electronic books. $2 local $3 554714
690 $a 0544
690 $a 0723
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Arizona State University. $b Electrical Engineering. $3 845389
773 0 $t Dissertation Abstracts International $g 79-09B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10788851 $z click for full text (PQDT)