2012/10/31 by Arti D. Yardi, Yardi, Arti D., Saravanan Vijayakumaran +1
Computer Science · Mathematics · #Algorithms and Data Compression #Coding theory and cryptography #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1210.8267
arxiv created 2012/10/31 · openalex publication_date 2012/10/31 · arxiv updated 2012/11/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we consider the problem of distinguishing the noisy codewords of a known binary linear block code from a random bit sequence. We propose to use the generalized likelihood ratio test (GLRT) to solve this problem. We also give a formula to find approximate number of codewords required and compare our results with an existing method.