Method for decoding a sequence of symbols, said sequence of symbols having been generated by calculating a cyclic redundancy check value for an initial message, combining the initial message and the cyclic redundancy check value to produce a message, hereinafter called transformed message, inserting stuffing bits into the transformed message, and encoding the transformed message in which the stuffing bits are inserted prior to the encoding; the decoding comprising the generation of a plurality of path hypotheses across a trellis comprising nodes and branches, said branches representing the possible transitions between said nodes, as well as the selection of the most probable path hypothesis from said path hypotheses, with respect to the sequence of symbols, method in which said nodes represent the elements of a Cartesian product of at least the set of encoder states likely to have performed said encoding and the set of calculator states likely to have calculated the cyclic redundancy check value, and in that a transition from a first node, corresponding to a first encoder state and a first calculator state, to a second node, corresponding to a second encoder state and a second calculator state, is possible, ∘ in the presence of a bit of transformed message, if - on applying this bit of transformed message to the encoder that is in the first encoder state, the encoder then passes to the second encoder state, and - on applying this bit of transformed message to the calculator that is in the first calculator state, the calculator passes to the second calculator state characterised in that the branches of the trellis comprise branches representing conditional transitions that can be used solely in the presence of a stuffing bit, and in which a transition from said first node to said second node being moreover possible ∘ in the presence of a stuffing bit, if - on applying this stuffing bit to the encoder that is in the first encoder state, the encoder then passes to the second encoder state, and - the first calculator state is equal to the second calculator state. ∘ in the presence of a bit of transformed message, if - on applying this bit of transformed message to the encoder that is in the first encoder state, the encoder then passes to the second encoder state, and - on applying this bit of transformed message to the calculator that is in the first calculator state, the calculator passes to the second calculator state characterised in that the branches of the trellis comprise branches representing conditional transitions that can be used solely in the presence of a stuffing bit, and in which a transition from said first node to said second node being moreover possible - on applying this bit of transformed message to the encoder that is in the first encoder state, the encoder then passes to the second encoder state, and - on applying this bit of transformed message to the calculator that is in the first calculator state, the calculator passes to the second calculator state ∘ in the presence of a stuffing bit, if - on applying this stuffing bit to the encoder that is in the first encoder state, the encoder then passes to the second encoder state, and - the first calculator state is equal to the second calculator state. - on applying this stuffing bit to the encoder that is in the first encoder state, the encoder then passes to the second encoder state, and - the first calculator state is equal to the second calculator state.