Minimax Optimal Universal Codeword Sets
In an interactive multi-user data-processing system a user knows the probabilities of his messages and must encode them into a fixed system-wide variable-length codeword set. He needs to receive the answer to his last message before selecting the next, so his encoding is one-shot. To minimize averag...
Main Author: | Elias, Peter |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149023 |
Similar Items
-
Average width of balanced codewords
by: Song, Qiumin
Published: (2021) -
CODEWORDS CORRECTION ON THE BASIS OF PARITY CHECKS
by: A. S. Poljakov, et al.
Published: (2019-06-01) -
Codewords generated by UP-valued functions
by: Ronnason Chinram, et al.
Published: (2021-03-01) -
Optimization and Generalization of Minimax Algorithms
by: Pattathil, Sarath
Published: (2023) -
The maximum number of minimal codewords in long codes
by: Alahmadi, A., et al.
Published: (2013)