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
Distributed Consensus, Optimization, and Learning under Communication Constraints
Zheng Chen, Nicolò Michelusi, Themistoklis Charalambous et al.
Energy-Accumulate-Then-Act Backscatter Communications With Retransmission Under Imperfect Feedback Detection
Rui Xu, Yinghui Ye, Guangyue Lu et al.
The Exact Memory-Rate Tradeoff for Three-User Secure Coded Caching
Han Fang, Nan Liu, Wei Kang
Cross-Modal Semantic Successive Refinement for Generative Image Communication over Underwater Acoustic Channels
Xu Pei, Bin Wang, Guangxu Zhu et al.
Fano's Inequality and Channel Capacity in the Individual-Sequence Regime
Neri Merhav
Exact Transport-Information Correspondence for Distribution-Adaptive Discretization
Koretaka Yuge