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,...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 66; no. 5; pp. 2912 - 2920
Main Author:	Merhav, Neri
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.05.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!