Codes for error detection, good or not good
Irina Naydenova, Torleiv Klove
Abstract
Linear codes for error detection on a q-ary symmetric channel are studied. It is shown that for given dimension k and minimum distance d, there exists a value μ(d,k) such that if C is a code of length n >= μ(d,k), then neither C nor its dual are good for error detection. For d >> k or k << d good approximations for μ(d,k) are given. A generalization to non-linear codes is also given.
Create a lesson
Related papers
Galois Hulls of Generalized Roth-Lempel Codes and Their Applications to EAQECCs
Xuefei Wu, Qi Liu, Yingchun Chen et al.
Maximum Entropy Probability Distributions on Spheres with Fixed Mean Busemann Function and Holomorphic-Information-Geometric Model of Cognition
Vladimir Jacimovic
Norm-One Torus Decompositions and Decoding of Gashkov-Sidel'nikov Codes
Minjia Shi, Shitao Li, Yuhong Xia et al.
A Mirror Vanishing Band for Weight Distributions of Binary Linear Codes
Xianmang He
Tri-Hybrid Beamforming Design for Large-Scale MIMO ISAC Systems
Tianyu Fang, Mengyuan Ma, Markku Juntti et al.
Equivalence Between Nested Gibbs Measures and Log-Linear Combinations of Gibbs Measures
Yaiza Bermudez, Samir M. Perlaza, Iñaki Esnaola