A method for testing the quality of a signal transmission in a communication system , comprising: a) generating (S0) a signal comprising a succession of first bit sequences X n with n = 0, 1, 2, ..., wherein each first bit sequence X n with n ≥ 1 is determined from the preceding first bit sequence X n-1 and using a deterministic algorithm P; b) sending (S1) the signal from a transmitter device to a receiver device through the communication system ; c) for each first bit sequence X n of the signal transmitted through the communication system, receiving (S2), by the receiver device , a second bit sequence X n ' ; and, characterised in that , for each second bit sequence X n ' with n ≥ 1. d) determining (S4, S7) a first group of candidates X n , i i ∈ N corresponding to a plurality of possible first bit sequences X n,i with i = 0, 1, 2, ... that could have been sent from the transmitter device and changed into the second bit sequence X n ' according to an acceptable modification in the communication system , defined by a tolerated and expected error ; e) determining (S5, S8) a second group of candidates Y n , j j ∈ N with j = 0, 1, 2, ... from candidates X n − 1 , k k ∈ N determined from the preceding second bit sequence X n-1 ' and using the deterministic algorithm P; f) intersecting (S6, S9) the first group of candidates X n , i i ∈ N and the second group of candidates Y n , j j ∈ N , to obtain the candidates that are present in both the first group of candidates X n , i i ∈ N and the second group of candidates X n , j j ∈ N in order to determine a third group of candidates X n , k k ∈ N that includes the obtained candidates g) checking said third group of candidates X n , k k ∈ N (S10) in order to determine the quality of the signal transmission based on whether the third group of candidates is empty or not. a) generating (S0) a signal comprising a succession of first bit sequences X n with n = 0, 1, 2, ..., wherein each first bit sequence X n with n ≥ 1 is determined from the preceding first bit sequence X n-1 and using a deterministic algorithm P; b) sending (S1) the signal from a transmitter device to a receiver device through the communication system ; c) for each first bit sequence X n of the signal transmitted through the communication system, receiving (S2), by the receiver device , a second bit sequence X n ' ; and, characterised in that , for each second bit sequence X n ' with n ≥ 1. d) determining (S4, S7) a first group of candidates X n , i i ∈ N corresponding to a plurality of possible first bit sequences X n,i with i = 0, 1, 2, ... that could have been sent from the transmitter device and changed into the second bit sequence X n ' according to an acceptable modification in the communication system , defined by a tolerated and expected error ; e) determining (S5, S8) a second group of candidates Y n , j j ∈ N with j = 0, 1, 2, ... from candidates X n − 1 , k k ∈ N determined from the preceding second bit sequence X n-1 ' and using the deterministic algorithm P; f) intersecting (S6, S9) the first group of candidates X n , i i ∈ N and the second group of candidates Y n , j j ∈ N , to obtain the candidates that are present in both the first group of candidates X n , i i ∈ N and the second group of candidates X n , j j ∈ N in order to determine a third group of candidates X n , k k ∈ N that includes the obtained candidates g) checking said third group of candidates X n , k k ∈ N (S10) in order to determine the quality of the signal transmission based on whether the third group of candidates is empty or not. <EOS>