pith. sign in

arxiv: 1210.8267 · v1 · pith:CDFHD7AKnew · submitted 2012-10-31 · 💻 cs.IT · math.IT

Detecting Linear Block Codes in Noise using the GLRT

classification 💻 cs.IT math.IT
keywords blockcodewordsglrtlinearproblemapproximatebinarycode
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.