Image de couverture de livre

Weight distribution bounds to relate minimum distance, list decoding, and symmetric channel performance

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kougang-Yombi, Donald, Hązła, Jan
Format:	Preprint
Publié:	2026
Sujets:	Information Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Quantitative Version of More Capable Channel Comparison
par: Kougang-Yombi, Donald, et autres
Publié: (2024)

Learning High-Degree Parities: The Crucial Role of the Initialization
par: Abbe, Emmanuel, et autres
Publié: (2024)

On the error correction of iterative bounded distance decoding of generalized LDPC codes
par: Burshtein, David
Publié: (2025)

Bounds for list-decoding and list-recovery of random linear codes
par: Guruswami, Venkatesan, et autres
Publié: (2020)

Improvement of the square-root low bounds on the minimum distances of BCH codes and Matrix-product codes
par: Wang, Xiaoqiang, et autres
Publié: (2025)

The minimum distance of the antiprimitive BCH code with designed distance 3
par: Xu, Haojie, et autres
Publié: (2025)

Deterministic list decoding of Reed-Solomon codes
par: Chatterjee, Soham, et autres
Publié: (2025)

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
par: Alrabiah, Omar, et autres
Publié: (2023)

On the largest minimum distances of [n,6] LCD codes
par: Liu, Yang, et autres
Publié: (2024)

Generalized graph codes and thier minimum distances
par: Fujii, Naoki
Publié: (2025)

Leveraging parallelizability and channel structure in THz-band, Tbps channel-code decoding
par: Jemaa, Hakim, et autres
Publié: (2024)

Secure list decoding and its application to bit-string commitment
par: Hayashi, Masahito
Publié: (2021)

On the hardness of approximating minimum distances of quantum codes
par: Grigorescu, Elena, et autres
Publié: (2025)

Four constructions of self-dual binary cyclic codes with a lower bound on the minimum distances better than the square-root bound
par: Wang, Xiaoqiang, et autres
Publié: (2026)

Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes
par: Goyal, Rohan, et autres
Publié: (2023)

On the minimum Hamming distance between vectorial Boolean and affine functions
par: Nagy, Gabor P.
Publié: (2025)

Zero-entropy encoders and simultaneous decoders in identification via quantum channels
par: Colomer, Pau, et autres
Publié: (2024)

Improving the decoding performance of CA-polar codes
par: Feng, Jiewei, et autres
Publié: (2025)

Efficient and rate-optimal list-decoding in the presence of minimal feedback: Weldon and Slepian-Wolf in sheep's clothing
par: Joshi, Pranav, et autres
Publié: (2025)

Generalized Samorodnitsky noisy function inequalities, with applications to error-correcting codes
par: Abawonse, Olakunle S., et autres
Publié: (2025)

Construction of observable and MDP convolutional codes with good decodable properties for erasure channels by I/S/O representations
par: DeCastro-García, Noemí, et autres
Publié: (2024)

Tight bounds for stream decodable error-correcting codes
par: Gupta, Meghal, et autres
Publié: (2024)

The constructions of Singleton-optimal locally repairable codes with minimum distance 6 and locality 3
par: Xiong, Yanzhen, et autres
Publié: (2026)

Deterministic identification for Bernoulli channels and related channels with continuous input
par: Colomer, Pau, et autres
Publié: (2026)

Binary $[n,(n\pm1)/2]$ cyclic codes with good minimum distances from sequences
par: Xie, Xianhong, et autres
Publié: (2024)

Exponents for classical-quantum channel simulation in purified distance
par: Oufkir, Aadil, et autres
Publié: (2024)

The minimum distance of a parameterized code over an even cycle
par: Camps-Moreno, Eduardo, et autres
Publié: (2024)

Regular LDPC codes on BMS wiretap channels: Security bounds
par: Pathegama, Madhura, et autres
Publié: (2025)

List decoding of repeated codes
par: Hernando, Fernando, et autres
Publié: (2012)

List decoding of evaluation codes
par: Brazitikos, Silouanos, et autres
Publié: (2025)

New bounds for codes over Gaussian integers based on the Mannheim distance
par: Shi, Minjia, et autres
Publié: (2026)

Discrete-time models and performance of phase noise channels
par: Piemontese, Amina, et autres
Publié: (2021)

Quasi-linear time decoding of RS and AG codes for burst errors up to the Singleton bound
par: Li, Songsong, et autres
Publié: (2025)

On the distance distributions of single-orbit cyclic subspace codes
par: Mahak, et autres
Publié: (2024)

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
par: Gabric, Daniel, et autres
Publié: (2026)

Code size constraints in b-symbol read channels: A bound analysis
par: Verma, Gyanendra K., et autres
Publié: (2025)

Performance Analysis of Perturbation-enhanced SC decoders
par: Liu, Zhicheng, et autres
Publié: (2025)

Turbo product decoding of cubic tensor codes
par: Khalifeh, Sarah, et autres
Publié: (2024)

Constituent automorphism decoding of Reed-Muller codes
par: Qu, Yicheng, et autres
Publié: (2024)

Infinitely many families of distance-optimal binary linear codes with respect to the sphere packing bound
par: Chen, Hao, et autres
Publié: (2025)