Imagen de Portada

On the Maximum Number of Codewords of X-Codes of Constant Weight Three

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Tsunoda, Yu, Fujiwara, Yuichiro
Formato:	Preprint
Publicado:	2019
Materias:	Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Weak Superimposed Codes of Improved Asymptotic Rate and Their Randomized Construction
por: Tsunoda, Yu, et al.
Publicado: (2024)

The Asymptotics of Difference Systems of Sets for Synchronization and Phase Detection
por: Tsunoda, Yu, et al.
Publicado: (2024)

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)

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

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)

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)

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)

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

Constant Weight Polar Codes through Periodic Markov Processes
por: Shuval, Boaz, et al.
Publicado: (2025)

Asymptotic Rate Bounds and Constructions for the Inclusive Variant of Disjunct Matrices
por: Mizunuma, Yuto, et al.
Publicado: (2026)

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

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

An Elementary Approach to MacWilliams Extension Property and Constant Weight Code with Respect to Weighted Hamming Metric
por: Xu, Yang, et al.
Publicado: (2025)

Optimal Constant-Weight and Mixed-Weight Conflict-Avoiding Codes
por: Lo, Yuan-Hsun, et al.
Publicado: (2024)

A Family of Low-Complexity Binary Codes with Constant Hamming Weights
por: Sasidharan, Birenjith, et al.
Publicado: (2024)

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

Three Families of Projective Binary Linear Codes of at Most Four Weights
por: Zhang, Tonghui, et al.
Publicado: (2025)

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

Automated Discovery of Improved Constant Weight Binary Codes
por: Rosin, Christopher D.
Publicado: (2026)

Quantum Speedup for Polar Maximum Likelihood Decoding
por: Fujiwara, Shintaro, et al.
Publicado: (2024)

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

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

Generalized Maximum Entropy Differential Dynamic Programming
por: Aoyama, Yuichiro, et al.
Publicado: (2024)

Analog Error Correcting Codes with Constant Redundancy
por: Song, Wentu, et al.
Publicado: (2026)

Correcting One Deletion and One Substitution with a Constant Number of Reads
por: Li, Yuling, et al.
Publicado: (2026)

Unbiased and Error-Detecting Combinatorial Pooling Experiments with Balanced Constant-Weight Gray Codes for Consecutive Positives Detection
por: He, Guanchen, et al.
Publicado: (2025)

On the Maximum Size of Codes Under the Damerau-Levenshtein Metric
por: Ye, Zuo, et al.
Publicado: (2025)

Identification Codes via Prime Numbers
por: Zinoghli, Emad, et al.
Publicado: (2024)

Weighted-Hamming Metric: Bounds and Codes
por: Bitzer, Sebastian, et al.
Publicado: (2026)

On the Hamming Weight Functions of Linear Codes
por: Huang, Dongmei, et al.
Publicado: (2025)

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

Quantum Locally Testable Code with Constant Soundness
por: Cross, Andrew, et al.
Publicado: (2022)

Policy-Guided MCTS for near Maximum-Likelihood Decoding of Short Codes
por: Tian, Y., et al.
Publicado: (2025)

Maximum Sum-Rank Distance Codes over Finite Chain Rings
por: Martínez-Peñas, Umberto, et al.
Publicado: (2021)

Multi-answer Constrained Optimal Querying: Maximum Information Gain Coding
por: Li, Zhefan, et al.
Publicado: (2024)

Decoding Product Codes and Staircase Codes with Iteration-Independent Weighting Coefficients
por: Straßhofer, Andreas
Publicado: (2026)