Detecting Linear Block Codes in Noise using the GLRT
Arti D. Yardi, Saravanan Vijayakumaran

TL;DR
This paper introduces a GLRT-based method for identifying known binary linear block codes in noisy data, providing formulas for codeword detection and comparison with existing techniques.
Contribution
The paper presents a novel GLRT approach for detecting linear block codes in noise and derives an approximate formula for the required number of codewords, improving detection strategies.
Findings
Effective detection of linear block codes in noisy environments.
Derived an approximate formula for the number of codewords needed.
Compared the proposed method with existing detection techniques.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Error Correcting Code Techniques · Algorithms and Data Compression
