Encoding Scheme For Infinite Set of Symbols: The Percolation Process

08/25/2021
by   Yousof Mardoukhi, et al.
0

It is shown here that the percolation process on binary trees that is equivalent to the critical Galton-Watson process with exactly two offspring for each node, yields a set of infinite symbols equipped with a natural encoding scheme that results in a finite average codeword length as long as the probability of having an offspring p is greater than 1/2 and is smaller than 1/sqrt(2). Furthermore, it is demonstrated that the amount of information encoded is finite.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/02/2020

Fundamental Limits of Distributed Encoding

In general coding theory, we often assume that error is observed in tran...
research
06/12/2020

On the Impact of Finite-Length ProbabilisticShaping on Fiber Nonlinear Interference

The interplay of shaped signaling and fiber nonlinearities is reviewed i...
research
01/13/2021

Improving Run Length Encoding by Preprocessing

The Run Length Encoding (RLE) compression method is a long standing simp...
research
06/12/2020

On the Impact of Finite-Length Probabilistic Shaping on Fiber Nonlinear Interference

The interplay of shaped signaling and fiber nonlinearities is reviewed i...
research
07/04/2023

An Optimal Multiple-Class Encoding Scheme for a Graph of Bounded Hadwiger Number

Since Jacobson [FOCS89] initiated the investigation of succinct graph en...
research
07/05/2023

Universal Rates for Multiclass Learning

We study universal rates for multiclass classification, establishing the...
research
07/15/2021

Compressing Multisets with Large Alphabets

Current methods that optimally compress multisets are not suitable for h...

Please sign up or login with your details

Forgot password? Click here to reset