Cover Image

A Characterization of Optimal Prefix Codes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Congero, Spencer, Zeger, Kenneth
Format:	Preprint
Published:	2023
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Competitive Advantage of Huffman and Shannon-Fano Codes
by: Congero, Spencer, et al.
Published: (2023)

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

About Optimal Prefix Codes over Countably Infinite Alphabets: Probabilistic Intervals for the Codeword Lengths Assignment
by: Liu, Hongyang, et al.
Published: (2026)

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

Lagrangians, Renormalization, and Quantization in Prefix Coding
by: Kolpakov, Alexander, et al.
Published: (2025)

Molecular Arithmetic Coding (MoAC) and Optimized Molecular Prefix Coding (MoPC) for Diffusion-Based Molecular Communication
by: Şahin, Melih, et al.
Published: (2024)

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

Characterizing the Optimal Memory-Rate Tradeoff in Secure Coded Caching for Small Buffer or Small Rate
by: Fang, Han, et al.
Published: (2025)

Optimal Codes with Positive Griesmer Defects, Related Optimal and Almost Optimal LRC Codes
by: Wang, Yurui, et al.
Published: (2026)

Optimal Multidimensional Convolutional Codes
by: Abreu, Z., et al.
Published: (2026)

Characterization of Blind Code Rate Recovery in Linear Block Codes
by: Vedantam, Atreya, et al.
Published: (2026)

Quasi-Perfect and Distance-Optimal Codes Sum-Rank Codes
by: Chen, Hao
Published: (2024)

A Structural Characterization of Cyclotomic Cosets with Applications to Affine-Invariant Codes and BCH Codes
by: Zheng, Xiongkun, et al.
Published: (2026)

Computer-aided Characterization of Fundamental Limits of Coded Caching with Linear Coding
by: Brembilla, Niccolò, et al.
Published: (2025)

Asymptotically Optimal Codes for $(t,s)$-Burst Error
by: Sun, Yubo, et al.
Published: (2024)

A Construction of Optimal Quasi-cyclic Locally Recoverable Codes using Constituent Codes
by: Bastos, Gustavo Terra, et al.
Published: (2024)

Function-Correcting Codes with Optimal Data Protection for Hamming Code Membership
by: Durgi, Swaraj Sharma, et al.
Published: (2026)

Optimal and Almost Optimal Locally Repairable Codes from Hyperelliptic Curves
by: Huang, Junjie, et al.
Published: (2025)

Combinatorial Constructions of Optimal Quaternary Additive Codes
by: Guan, Chaofeng, et al.
Published: (2024)

Optimal Linear MAP Decoding of Convolutional Codes
by: Li, Yonghui, et al.
Published: (2025)

On the Optimality of Coded Distributed Computing for Ring Networks
by: Huang, Zhenhao, et al.
Published: (2025)

Bounds and Optimal Constructions of Generalized Merge-Convertible Codes for Code Conversion into LRCs
by: Shi, Haoming, et al.
Published: (2025)

An Optimal Decentralized Multi-access Coded Caching System
by: Dutta, Monolina, et al.
Published: (2022)

Near-Optimal Generalized Decoding of Polar-like Codes
by: Yuan, Peihong, et al.
Published: (2024)

On the Optimal Source Key Size of Secure Gradient Coding
by: Zhou, Yang, et al.
Published: (2025)

An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes
by: Singhvi, Shubhransh, et al.
Published: (2024)

Optimal Erasure Codes and Codes on Graphs
by: Chen, Yeyuan, et al.
Published: (2025)

An Algebraic Method for Full-Rank Characterization in Binary Linear Coding
by: Zhu, Mingyang, et al.
Published: (2026)

Few-Shot Channel-Agnostic Analog Coding: A Near-Optimal Scheme
by: Maddah-Ali, Mohammad Ali, et al.
Published: (2024)

Reed-Solomon Codes with Optimal Repair Bandwidth: A Basis-Transformation Approach
by: Qiu, Jing, et al.
Published: (2026)

CVNN-based Channel Estimation and Equalization in OFDM Systems Without Cyclic Prefix
by: Sousa, Heitor dos Santos, et al.
Published: (2023)

Cyclic and Negacyclic Codes with Optimal and Best Known Minimum Distances
by: Chen, Hao, et al.
Published: (2024)

How to Read and Update Coded Distributed Storage Robustly and Optimally?
by: Jia, Haobo, et al.
Published: (2024)

On Low Field Size Constructions of Access-Optimal Convertible Codes
by: Chopra, Saransh, et al.
Published: (2024)

Strong Singleton-Like Bounds, Quasi-Perfect Codes and Distance-Optimal Codes in the Sum-Rank Metric
by: Liu, Chao, et al.
Published: (2026)

The Entropy Characterization of Quantum MDS Codes
by: Sun, Hua
Published: (2025)

On Weight Enumeration and Structure Characterization of Polar Codes via Group Actions
by: Dragoi, Vlad-Florin, et al.
Published: (2025)

Winning Criteria for Open Games: A Game-Theoretic Approach to Prefix Codes
by: Kraizberg, Dean
Published: (2026)

Optimal Two-Dimensional Reed--Solomon Codes Correcting Insertions and Deletions
by: Con, Roni, et al.
Published: (2023)

Reducing The Sub-packetization Level of Optimal-Access Cooperative MSR Codes
by: Zhang, Yaqian, et al.
Published: (2026)