Imagen de Portada

Competitive Advantage of Huffman and Shannon-Fano Codes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Congero, Spencer, Zeger, Kenneth
Formato:	Preprint
Publicado:	2023
Materias:	Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Characterization of Optimal Prefix Codes
por: Congero, Spencer, et al.
Publicado: (2023)

Probability of super-regular matrices and MDS codes over finite fields
por: Appuswamy, Rathinakumar, et al.
Publicado: (2026)

Semantic Huffman Coding using Synonymous Mapping
por: Xu, Jin, et al.
Publicado: (2024)

Generalization of the Fano and Non-Fano Index Coding Instances
por: Sharififar, Arman, et al.
Publicado: (2024)

Universal Coding for Shannon Ciphers under Side-Channel Attacks
por: Oohama, Yasutada, et al.
Publicado: (2023)

Returning to Shannon's Original Meaning
por: Yang, Xuezhi
Publicado: (2019)

The Shannon Upper Bound for the Error Exponent
por: Tridenski, Sergey, et al.
Publicado: (2025)

On the Ratio of Shannon Numbers of Graphs
por: Alipour, Sharareh, et al.
Publicado: (2023)

Advances in the Shannon Capacity of Graphs
por: Lavi, Nitay, et al.
Publicado: (2025)

Singular Relative Entropy Coding with Bits-Back Rejection Sampling
por: Flamich, Gergely, et al.
Publicado: (2026)

Large Deviation Analysis for the Reverse Shannon Theorem
por: Li, Shi-Bing, et al.
Publicado: (2024)

Semantic Information in MC: Chemotaxis Beyond Shannon
por: Brand, Lukas, et al.
Publicado: (2024)

Shannon Bounds for Quadratic Rate-Distortion Problems
por: Gastpar, Michael, et al.
Publicado: (2024)

The Representation Jensen-Shannon Divergence
por: Hoyos-Osorio, Jhoan K., et al.
Publicado: (2023)

Shannon meets Gödel-Tarski-Löb: Undecidability of Shannon Feedback Capacity for Finite-State Channels
por: Majumdar, Angshul
Publicado: (2026)

Generalizing the Fano inequality further
por: Bongole, Raghav, et al.
Publicado: (2026)

Combining PatternRank with Huffman Coding: A Novel Compression Algorithm
por: Shukurov, Jasurbek
Publicado: (2024)

Physics-Aware, Shannon-Optimal Compression via Arithmetic Coding for Distributional Fidelity
por: Fanelli, Cristiano
Publicado: (2026)

Successive Refinement of Shannon Cipher System Under Maximal Leakage
por: Wu, Zhuangfei, et al.
Publicado: (2023)

Second 6G life Workshop on Post Shannon Theory
por: Zhao, Yaning, et al.
Publicado: (2024)

From Classical to Quantum Shannon Theory
por: Wilde, Mark M.
Publicado: (2011)

Quantum Reverse Shannon Theorem Revisited
por: Khanian, Zahra Baghali, et al.
Publicado: (2025)

Scalable Precise Computation of Shannon Entropy
por: Lai, Yong, et al.
Publicado: (2025)

Rejection Sampling is Optimal for Relative Entropy Coding
por: Hill, Spencer, et al.
Publicado: (2026)

Polynomial Freiman-Ruzsa, Reed-Muller codes and Shannon capacity
por: Abbe, Emmanuel, et al.
Publicado: (2024)

A Distributionally Robust Approach to Shannon Limits using the Wasserstein Distance
por: Malik, Vikrant, et al.
Publicado: (2024)

Refinements and Generalizations of the Shannon Lower Bound via Extensions of the Kraft Inequality
por: Merhav, Neri
Publicado: (2025)

Boltzmann-Shannon Index: A Geometric-Aware Measure of Clustering Balance
por: Bossi, Emanuele, et al.
Publicado: (2025)

Shannon information and integrated information: message and meaning
por: Zaeemzadeh, Alireza, et al.
Publicado: (2024)

Two tales for a geometric Jensen--Shannon divergence
por: Nielsen, Frank
Publicado: (2025)

Quantum Advantages in (n,d)->1 Random Access Codes
por: Ambainis, Andris, et al.
Publicado: (2015)

Information Decomposition Diagrams Applied beyond Shannon Entropy: A Generalization of Hu's Theorem
por: Lang, Leon, et al.
Publicado: (2022)

Quantum Reverse Shannon Theorem Simplified
por: Gour, Gilad
Publicado: (2025)

Breaking through the classical Shannon entropy limit: A new frontier through logical semantics
por: Lastras, Luis A., et al.
Publicado: (2024)

Shannon Weights for binary dynamical recurrent sources of zero entropy
por: Akhavi, Ali, et al.
Publicado: (2025)

A Generalized Nyquist-Shannon Sampling Theorem Using the Koopman Operator
por: Zeng, Zhexuan, et al.
Publicado: (2023)

Information Theoretic Limits of Cardinality Estimation: Fisher Meets Shannon
por: Pettie, Seth, et al.
Publicado: (2020)

An example showing that Schrijver's $\vartheta$-function need not upper bound the Shannon capacity of a graph
por: Sason, Igal
Publicado: (2025)

Assembly Theory Reduced to Shannon Entropy and Rendered Redundant by Naive Statistical Algorithms
por: Ozelim, Luan, et al.
Publicado: (2024)

Multichannel Conflict-Avoiding Codes for Expanded Scenarios
por: Wong, Tsai-Lien, et al.
Publicado: (2026)