:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Kougang-Yombi, Donald, Hązła, Jan
Format:	Preprint
Published:	2026
Subjects:	Information Theory
Online Access:	https://arxiv.org/abs/2604.02994
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

Generalized graph codes and thier minimum distances
by: Fujii, Naoki
Published: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

List decoding of repeated codes
by: Hernando, Fernando, et al.
Published: (2012)

List decoding of evaluation codes
by: Brazitikos, Silouanos, et al.
Published: (2025)

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

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

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

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

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

Geometric opinion exchange polarizes in every dimension
by: Alidou, Abdou Majeed, et al.
Published: (2025)

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

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

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

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

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