Guessing Individual Sequences: Generating Randomized Guesses Using Finite-State Machines

Motivated by earlier results on universal randomized guessing, we consider an individual-sequence approach to the guessing problem: in this setting, the goal is to guess a secret, individual (deterministic) vector <inline-formula> <tex-math notation="LaTeX">x^{n}=(x_{1},\ldots,...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on information theory Ročník 66; číslo 5; s. 2912 - 2920
Hlavný autor:	Merhav, Neri
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.05.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Asymptotic properties Binary trees Compressibility Data compression Decoding finite–state machine Guessing exponent Hidden Markov models incremental parsing individual sequences Lempel–Ziv algorithm Password Probabilistic logic Randomization randomized guessing sequence complexity side information State machines Viterbi algorithm
ISSN:	0018-9448, 1557-9654
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!