Efficient Generation of Random Bits From Finite State Markov Chains
From MaRDI portal
Publication:5272028
DOI10.1109/TIT.2011.2175698zbMath1365.94392arXiv1012.5339MaRDI QIDQ5272028
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.5339
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)