We define a D-ary Fano code based on a natural generalization of the splitting criterion of the binary Fano code to the case of D-ary code. We show that this choice allows for an efficient computation of the code tree and also leads to a strong guarantee with respect to the redundancy of the resulting code: for any source distribution p = p1,. p
On D-ary Fano Codes
Cicalese, F
;
2020-01-01
Abstract
We define a D-ary Fano code based on a natural generalization of the splitting criterion of the binary Fano code to the case of D-ary code. We show that this choice allows for an efficient computation of the code tree and also leads to a strong guarantee with respect to the redundancy of the resulting code: for any source distribution p = p1,. p
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Fano-Dary-ISIT2020-cameraready-final.pdf
solo utenti autorizzati
Tipologia:
Documento in Post-print
Licenza:
Copyright dell'editore
Dimensione
284.19 kB
Formato
Adobe PDF
|
284.19 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
