Learning Source Coding for General Alphabets and Finite State Machines

Mohammad Zaeri Amirani,Anders Høst-Madsen

2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton)（2023）

Cited 0|Views3

No score

Abstract

This paper develops bounds for learning lossless source coding under the PAC (probably approximately correct) framework. The paper considers both iid sources and sources generated by finite state machines (FSM).

Translated text

AI Read Science

Must-Reading Tree

Example

Generate MRT to find the research sequence of this paper

Chat Paper

Summary is being generated by the instructions you defined