:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Liu, Hongyang, Yan, Wei
Formato:	Preprint
Publicado:	2026
Materias:	Information Theory
Acceso en línea:	https://arxiv.org/abs/2604.17443
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

Guessing What, Noise or Codeword?
por: Ma, Xiao
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
por: Alrabiah, Omar, et al.
Publicado: (2023)

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