Minimax optimal universal codeword sets

DOI10.1109/TIT.1983.1056717MaRDI QIDQ3335679zbMATH OpenFDO

Authors Peter Eliaš

Publication date 1983

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1983.1056717

zbMATH Keywords

interactive multi-user data-processing systemminimax optimal codeword sets

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Recommendations

• Optimal universal coding with respect to the maximal individual relative redundancy criterion
• scientific article; zbMATH DE number 3463524
• Regular universal codeword sets (Corresp.)
• Universal noiseless coding
• scientific article; zbMATH DE number 3463523

Cited in

(2)

• Minimax Universal Decoding With an Erasure Option
• Regular universal codeword sets (Corresp.)

This page was built for publication: Minimax optimal universal codeword sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335679)