A method for transmitting non-binary error correcting code word symbols through a transmission channel, each code word symbol comprising p bits and being part of a finite field GF q with q=2 p elements, the method including: - a first spread spectrum modulation associating a sequence of chips with each p-bit code word symbol, - a second modulation for modulating at least one carrier with the sequences associated with the code words, by phase or amplitude modulation, making it possible to obtain at least one modulated carrier, - a transmission of said at least one modulated carrier forming a signal through said transmission channel, wherein the first modulation implements a set of q sequences comprising q-1 sequences of q-1 chips, each sequence being obtained by circular shifting of a basic pseudo-random sequence (R 0), and a partially invariant sequence, consisting of q-1 chips and invariant to a predetermined subset of circular shifts, and the first modulation further implements an association between each code word symbol and a sequence of the set of sequences wherein, said finite field GF q has a non-zero primitive element, the symbol zero being associated with said partially invariant sequence and a symbol equal to a power j of the primitive element, j being an integer comprised between 0 and q-2, being associated with a pseudo-random sequence determined by j circular shifts of the basic pseudo-random sequence (R 0). - a first spread spectrum modulation associating a sequence of chips with each p-bit code word symbol, - a second modulation for modulating at least one carrier with the sequences associated with the code words, by phase or amplitude modulation, making it possible to obtain at least one modulated carrier, - a transmission of said at least one modulated carrier forming a signal through said transmission channel, wherein the first modulation implements a set of q sequences comprising q-1 sequences of q-1 chips, each sequence being obtained by circular shifting of a basic pseudo-random sequence (R 0), and a partially invariant sequence, consisting of q-1 chips and invariant to a predetermined subset of circular shifts, and the first modulation further implements an association between each code word symbol and a sequence of the set of sequences wherein, said finite field GF q has a non-zero primitive element, the symbol zero being associated with said partially invariant sequence and a symbol equal to a power j of the primitive element, j being an integer comprised between 0 and q-2, being associated with a pseudo-random sequence determined by j circular shifts of the basic pseudo-random sequence (R 0). wherein the first modulation implements a set of q sequences comprising q-1 sequences of q-1 chips, each sequence being obtained by circular shifting of a basic pseudo-random sequence (R 0), and a partially invariant sequence, consisting of q-1 chips and invariant to a predetermined subset of circular shifts, and the first modulation further implements an association between each code word symbol and a sequence of the set of sequences wherein, said finite field GF q has a non-zero primitive element, the symbol zero being associated with said partially invariant sequence and a symbol equal to a power j of the primitive element, j being an integer comprised between 0 and q-2, being associated with a pseudo-random sequence determined by j circular shifts of the basic pseudo-random sequence (R 0).