:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Tsunoda, Yu, Fujiwara, Yuichiro
Format:	Preprint
Published:	2019
Subjects:	Information Theory
Online Access:	https://arxiv.org/abs/1903.09788
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

The Asymptotics of Difference Systems of Sets for Synchronization and Phase Detection
by: Tsunoda, Yu, et al.
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)

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

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

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

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

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)

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)

Asymptotic Rate Bounds and Constructions for the Inclusive Variant of Disjunct Matrices
by: Mizunuma, Yuto, 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)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Identification Codes via Prime Numbers
by: Zinoghli, Emad, et al.
Published: (2024)

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

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

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

On the Weight Distribution of Weights Less than $2w_{\min}$ in Polar Codes
by: Ye, Zicheng, et al.
Published: (2023)

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

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