Cover Image

About Optimal Prefix Codes over Countably Infinite Alphabets: Probabilistic Intervals for the Codeword Lengths Assignment

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Hongyang, Yan, Wei
Format:	Preprint
Published:	2026
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications
by: Bruno, Roberto, et al.
Published: (2025)

Construction of Complete Complementary Codes over Small Alphabet
by: Sarkar, Palash, et al.
Published: (2021)

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

On the Maximum Number of Codewords of X-Codes of Constant Weight Three
by: Tsunoda, Yu, et al.
Published: (2019)

Multiple Spectrally Null Constrained Complete Complementary Codes of Various Lengths Over Small Alphabet
by: Kumar, Rajen, et al.
Published: (2024)

Common Randomness Generation from Sources with Infinite Polish Alphabet
by: Labidi, Wafa, et al.
Published: (2024)

Near-Codewords Aware Bit Flipping Decoding of QC-MDPC Codes
by: Baldelli, Alessio, et al.
Published: (2026)

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes
by: Komech, Sergey, et al.
Published: (2025)

Guessing What, Noise or Codeword?
by: Ma, Xiao
Published: (2024)

The Generating Idempotent Is a Minimum-Weight Codeword for Some Binary BCH Codes
by: Shany, Yaron, et al.
Published: (2024)

Enumeration of Minimum Weight Codewords of Pre-Transformed Polar Codes by Tree Intersection
by: Zunker, Andreas, et al.
Published: (2023)

Codeword Stabilized Codes from m-Uniform Graph States
by: Sudevan, Sowrabh, et al.
Published: (2024)

Soft-output Guessing Codeword Decoding
by: Duffy, Ken R., et al.
Published: (2024)

Marker+Codeword+Marker: A Coding Structure for Segmented Single-Insdel/-Edit Channels
by: Li, Zhen, et al.
Published: (2024)

Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes
by: Berman, Amit, et al.
Published: (2023)

Finite Alphabet Fast List Decoders for Polar Codes
by: Shah, Syed Aizaz Ali, et al.
Published: (2024)

Old and New Results on Alphabetic Codes
by: Bruno, Roberto, et al.
Published: (2025)

Explicit Constant-Alphabet Subspace Design Codes
by: Goyal, Rohan, et al.
Published: (2026)

Explaining Robust Quantum Metrology by Counting Codewords
by: Novak, Oskar, et al.
Published: (2025)

LDPC Codes for Quantitative Group Testing with a Non-Binary Alphabet
by: Mashauri, Mgeni Makambi, et al.
Published: (2024)

Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
by: Bruno, Roberto, et al.
Published: (2024)

Finite Field Multiple Access II:from Symbol-wise to Codeword-wise
by: Yu, Qi-yue, et al.
Published: (2025)

Using a Single-Parity-Check to Reduce the Guesswork of Guessing Codeword Decoding
by: Griffin, Joseph, et al.
Published: (2024)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
by: Guo, Zeyu, et al.
Published: (2023)

An Achievability Bound for Variable-Length Stop-Feedback Coding over the Gaussian Channel
by: Papoutsidakis, Ioannis, et al.
Published: (2024)

Trace Reconstruction of First-Order Reed-Muller Codewords Using Run Statistics
by: Rathore, Shiv Pratap Singh, et al.
Published: (2025)

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

Asynchronous MIMO-OFDM Massive Unsourced Random Access with Codeword Collisions
by: Li, Tianya, et al.
Published: (2024)

Optimal Construction of N-bit-delay Almost Instantaneous Fixed-to-Variable-Length Codes
by: Sugiura, Ryosuke, et al.
Published: (2023)

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
by: Con, Roni, et al.
Published: (2024)

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

Codeword-Segmentation Rate-Splitting Multiple Access and Evaluation under Suboptimal Decoding
by: Zhang, Sibo, et al.
Published: (2025)

Optimal and Suboptimal Decoders under Finite-Alphabet Interference: A Mismatched Decoding Perspective
by: Zhang, Sibo, et al.
Published: (2025)

Weight Distribution of Repeated-Root Cyclic Codes with Prime Power Lengths
by: Zhao, Wei, et al.
Published: (2023)

Hybrid Character Sums From Vectorial Dual-Bent Functions and Asymptotically Optimal Complex Codebooks With Small Alphabet Sizes
by: Heng, Ziling, et al.
Published: (2025)

On the Maximal Length of MDS Elliptic Codes
by: Chen, Haojie, et al.
Published: (2026)

The Length of Functional Batch and PIR Codes
by: Kilic, Altan B., et al.
Published: (2025)

Systematic Construction of Golay Complementary Sets of Arbitrary Lengths and Alphabet Sizes
by: Roy, Abhishek, et al.
Published: (2024)

On the Optimality of Hierarchical Secure Aggregation with Arbitrary Heterogeneous Data Assignment
by: Sun, Chenyi, et al.
Published: (2026)

About the Rankin and Bergé-Martinet Constants from a Coding Theory View Point
by: Oggier, Frédérique, et al.
Published: (2025)