Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kougang-Yombi, Donald, Hązła, Jan
Formato:	Preprint
Publicado:	2026
Materias:	Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Quantitative Version of More Capable Channel Comparison
por: Kougang-Yombi, Donald, et al.
Publicado: (2024)

Learning High-Degree Parities: The Crucial Role of the Initialization
por: Abbe, Emmanuel, et al.
Publicado: (2024)

On the error correction of iterative bounded distance decoding of generalized LDPC codes
por: Burshtein, David
Publicado: (2025)

Bounds for list-decoding and list-recovery of random linear codes
por: Guruswami, Venkatesan, et al.
Publicado: (2020)

Improvement of the square-root low bounds on the minimum distances of BCH codes and Matrix-product codes
por: Wang, Xiaoqiang, et al.
Publicado: (2025)

The minimum distance of the antiprimitive BCH code with designed distance 3
por: Xu, Haojie, et al.
Publicado: (2025)

Deterministic list decoding of Reed-Solomon codes
por: Chatterjee, Soham, et al.
Publicado: (2025)

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
por: Alrabiah, Omar, et al.
Publicado: (2023)

On the largest minimum distances of [n,6] LCD codes
por: Liu, Yang, et al.
Publicado: (2024)

Generalized graph codes and thier minimum distances
por: Fujii, Naoki
Publicado: (2025)

Leveraging parallelizability and channel structure in THz-band, Tbps channel-code decoding
por: Jemaa, Hakim, et al.
Publicado: (2024)

Secure list decoding and its application to bit-string commitment
por: Hayashi, Masahito
Publicado: (2021)

On the hardness of approximating minimum distances of quantum codes
por: Grigorescu, Elena, et al.
Publicado: (2025)

Four constructions of self-dual binary cyclic codes with a lower bound on the minimum distances better than the square-root bound
por: Wang, Xiaoqiang, et al.
Publicado: (2026)

Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes
por: Goyal, Rohan, et al.
Publicado: (2023)

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

Zero-entropy encoders and simultaneous decoders in identification via quantum channels
por: Colomer, Pau, et al.
Publicado: (2024)

Improving the decoding performance of CA-polar codes
por: Feng, Jiewei, et al.
Publicado: (2025)

Efficient and rate-optimal list-decoding in the presence of minimal feedback: Weldon and Slepian-Wolf in sheep's clothing
por: Joshi, Pranav, et al.
Publicado: (2025)

Generalized Samorodnitsky noisy function inequalities, with applications to error-correcting codes
por: Abawonse, Olakunle S., et al.
Publicado: (2025)

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

Tight bounds for stream decodable error-correcting codes
por: Gupta, Meghal, et al.
Publicado: (2024)

The constructions of Singleton-optimal locally repairable codes with minimum distance 6 and locality 3
por: Xiong, Yanzhen, et al.
Publicado: (2026)

Deterministic identification for Bernoulli channels and related channels with continuous input
por: Colomer, Pau, et al.
Publicado: (2026)

Binary $[n,(n\pm1)/2]$ cyclic codes with good minimum distances from sequences
por: Xie, Xianhong, et al.
Publicado: (2024)

Exponents for classical-quantum channel simulation in purified distance
por: Oufkir, Aadil, et al.
Publicado: (2024)

The minimum distance of a parameterized code over an even cycle
por: Camps-Moreno, Eduardo, et al.
Publicado: (2024)

Regular LDPC codes on BMS wiretap channels: Security bounds
por: Pathegama, Madhura, et al.
Publicado: (2025)

List decoding of repeated codes
por: Hernando, Fernando, et al.
Publicado: (2012)

List decoding of evaluation codes
por: Brazitikos, Silouanos, et al.
Publicado: (2025)

New bounds for codes over Gaussian integers based on the Mannheim distance
por: Shi, Minjia, et al.
Publicado: (2026)

Discrete-time models and performance of phase noise channels
por: Piemontese, Amina, et al.
Publicado: (2021)

Quasi-linear time decoding of RS and AG codes for burst errors up to the Singleton bound
por: Li, Songsong, et al.
Publicado: (2025)

On the distance distributions of single-orbit cyclic subspace codes
por: Mahak, et al.
Publicado: (2024)

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
por: Gabric, Daniel, et al.
Publicado: (2026)

Code size constraints in b-symbol read channels: A bound analysis
por: Verma, Gyanendra K., et al.
Publicado: (2025)

Performance Analysis of Perturbation-enhanced SC decoders
por: Liu, Zhicheng, et al.
Publicado: (2025)

Turbo product decoding of cubic tensor codes
por: Khalifeh, Sarah, et al.
Publicado: (2024)

Constituent automorphism decoding of Reed-Muller codes
por: Qu, Yicheng, et al.
Publicado: (2024)

Infinitely many families of distance-optimal binary linear codes with respect to the sphere packing bound
por: Chen, Hao, et al.
Publicado: (2025)