single parity check performance close form

57 Views Asked by At

Does anyone know of a closed form solution for the bit and word probabilty of error for the single parity check codes (for AWGN channel)? These are $[n.n-1,2]_2$ codes that are the duals of the repetition codes $[n,1,n]_2$.