Abstract: The invention relates to a method for correcting a message the generation of which involves transforming an initial message and inserting bit stuffing into the transformed message, which method comprises providing an observation sequence containing the message to be corrected. A number of path hypotheses are generated via a trellis diagram associated with the transformation. The nodes of the trellis diagram each represent a state of a finite-state machine capable of transforming the initial message and the branches represent the possible transitions between nodes. Among the branches of the trellis diagram, certain represent conditional transitions that may be made only when bit stuffing is present. During the generation of a path hypothesis, bit stuffing is detected and the branches taken are those associated with the detected bit stuffing. The most likely path hypothesis relative to the observation sequence is finally retained.

Abstract: The disclosure relates to a data fusion method for fusing the measurements of a parameter, for example an aircraft flight parameter, that are taken by a plurality of sensors comprising a set of main sensors and sets of secondary sensors. The discrepancy between each main measurement and the secondary measurements is determined and a score of consistency with them is deduced therefrom. For each fault configuration of the main sensors, a first estimation, so-called conditional, of the parameter is performed and a weighting coefficient relating to this fault is calculated, taking account of the consistency scores of the main measurements. The parameter is thereafter estimated by performing a combination of the conditional measurements with the associated weighting coefficients.

Abstract: The method according to the invention relates to the decoding of a sequence of symbols, the sequence of symbols having been generated by: calculating a CRC value for an initial message; combining the initial message and the CRC value so as to produce a transformed message; and, encoding the transformed message. The decoding comprises: generating a number of path hypotheses via a trellis diagram corresponding to the trellis diagram of a finite-state machine comprising the encoder and the CRC generator, in which the encoder and the CRC generator are supplied with the same input. According to a preferred embodiment of the method, the trellis diagram is adapted to take into account bit stuffing possibly inserted in the transformed message before encoding.

Abstract: The disclosure relates to a data fusion method for fusing the measurements of a parameter, for example an aircraft flight parameter, that are taken by a plurality of sensors comprising a set of main sensors and sets of secondary sensors. The discrepancy between each main measurement and the secondary measurements is determined and a score of consistency with them is deduced therefrom. For each fault configuration of the main sensors, a first estimation, so-called conditional, of the parameter is performed and a weighting coefficient relating to this fault is calculated, taking account of the consistency scores of the main measurements. The parameter is thereafter estimated by performing a combination of the conditional measurements with the associated weighting coefficients.

Abstract: The invention relates to a method for correcting a message the generation of which involves transforming an initial message and inserting bit stuffing into the transformed message, which method comprises providing an observation sequence containing the message to be corrected. A number of path hypotheses are generated via a trellis diagram associated with the transformation. The nodes of the trellis diagram each represent a state of a finite-state machine capable of transforming the initial message and the branches represent the possible transitions between nodes. Among the branches of the trellis diagram, certain represent conditional transitions that may be made only when bit stuffing is present. During the generation of a path hypothesis, bit stuffing is detected and the branches taken are those associated with the detected bit stuffing. The most likely path hypothesis relative to the observation sequence is finally retained.

Abstract: The method according to the invention relates to the decoding of a sequence of symbols, the sequence of symbols having been generated by: calculating a CRC value for an initial message; combining the initial message and the CRC value so as to produce a transformed message; and, encoding the transformed message. The decoding comprises: generating a number of path hypotheses via a trellis diagram corresponding to the trellis diagram of a finite-state machine comprising the encoder and the CRC generator, in which the encoder and the CRC generator are supplied with the same input. According to a preferred embodiment of the method, the trellis diagram is adapted to take into account bit stuffing possibly inserted in the transformed message before encoding.