Abstract: In the field of coding/decoding in telecommunications networks, an error correcting decoder and associated decoding method are adapted to a mesh network. In particular, the system for the decoding of a plurality of coded copies of a data word includes at least a first decoding stage with: a plurality of soft decision decoders, each decoder being arranged for decoding a coded copy received as decoder input, and a graph-based decoder comprising a plurality of nodes, each node of said graph-based decoder receiving the soft output value from a corresponding decoder and the graph-based decoder determining a decoding value of said data word on the basis of said soft output values.

Abstract: When decoding a set of symbols to be decoded, several data blocks representative of the set of symbols to be decoded are received by a decoding node of a communications network. The data blocks are encoded using an error correction code enabling a decoding by erasure. The decoding node performs the following steps: first selecting at least one of the data blocks, first determining first erasures, and checking whether the number of the first erasures is below a given threshold. In a case the check is positive, the decoding node performs first decoding by erasure of the set of symbols to be decoded. In a case the check is negative, the decoding node performs second selecting of at least one of the data blocks, second determining second erasures, and second decoding by erasure of the set of symbols to be decoded from the second erasures.

Abstract: A method of decoding a one-point algebraic geometric code defined on an algebraic curve of type C(a,b) represented by an equation F(X,Y) =0 of degree b in X and of degree a in Y over Fq, includes calculating extended error syndromes (?j(i)) associated with a received word (r) and determining the values of errors in each component r(x,yp,(x)) of the received word r, on the basis of the extended error syndromes calculated.

Abstract: A method is provided for configuring an overall encoding scheme comprising a first encoding for generating first encoded packets from source packets and a second encoding for generating second encoded packets by combination of first encoded packets according to a combination scheme applied by predetermined nodes of the network. The method obtains a number N of defective paths among paths used to transmit the first and second encoded packets to at least one destination node, a path being defective if an associated quality of transmission is below a predetermined threshold. A combination scheme is selected from among at least two possible predetermined combination schemes for which a number of encoded second packets is greater than or equal to N.

Abstract: A method provides for building a network coding scheme for the transmission of data between multiple source nodes and multiple destination nodes in a communications network having multiple nodes. The method includes the steps of: for each destination node, determining a first set of source nodes from which there exist disjointed paths, in the communications network, to reach the destination node; determining a second set of source nodes which is the intersection of the first determined sets for the destination nodes; and determining a sub-network for implementing the network coding. The sub-network includes source nodes which belong only to the second set of source nodes, the multiple destination nodes, and nodes included in the disjointed paths connecting the source nodes of the second set of source nodes and the destination nodes. The method also includes the step of building a network coding scheme based on the determined sub-network.

Abstract: The device for steering a beamforming antenna (500) comprises a module (511) for calculating antenna steering coefficients and a repetition detection module (516, 517) adapted to detect the repetition of a sequence of payload data in the signal received by said antenna. The module for calculating antenna steering coefficients is adapted to calculate said coefficients on the basis of the signals received by the antenna at the time of said repetition. In particular embodiments, the device further comprises an OFDM wireless receiver (501 to 503) and the module for calculating antenna steering coefficients employs each sub-carrier of the signal received by the antenna.

Abstract: In a wireless communication network comprising at least one mobile terminal and an access point, the access point detects a beacon signal transmitted by a mobile terminal, and transmits a beacon signal in place of a given mobile terminal if it detects that the given mobile terminal transmits a beacon signal. The mobile terminal, on the other hand, stops transmitting the beacon signal and receives the beacon signal transmitted by the access point.

Abstract: The invention relates to a method for transmitting a plurality of data packets to a receiver in a data communication system. The method comprises the steps of transmitting one or more data packets from a list of data packets to be transmitted (300); determining whether an acknowledgment is received for each transmitted data packet (301), and further comprises the following steps executed when it is determined at the determining step that an acknowledgement has not been received for at least one data packet, referred to as an unacknowledged data packet: selecting one or more additional data packets from the list of data packets to be transmitted (302); generating one or more parity packets by encoding a block of data containing a combination of the selected one or more additional data packets and at least one unacknowledged data packet using a forward error correction scheme (304); and transmitting at least one of the generated parity packets (305).

Abstract: A multimedia interface device for the transfer of information in a communications network comprises: at least two connection means to which, respectively, at least two sending devices can get connected by means respectively of two communications links compliant respectively with two protocols; means of connection to a single remote switching device by means of a single cable, the switching device comprising at least switching means between at least two ports; means to mix the information sent out by sending devices into only one stream of information in the form of segments being able to contain part of the information; and means to transfer the stream of information in the form of segments on at least one pair of cable to the switching device to which it is connected according to a third protocol.

Abstract: A modulation device comprises for each carrier frequency: means of discrimination between a signal coming from a first channel of a communications link and a signal coming from a second channel of said link, so as to obtain differentiated first and second signals; first assigning means, enabling the assigning of the first differentiated signal to one of the two modulation arms, and the second differentiated signal to the other of the two modulation arms.

Abstract: A method is proposed for building a network coding scheme adapted to the transmission of data between a plurality of source nodes and a plurality of destination nodes in a communications network comprising a plurality of nodes, the method comprising the following steps: for each destination node, determining a first set of source nodes from which there exist disjointed paths, in the communications network, to reach the destination node; determining a second set of source nodes which is the intersection of the first determined sets for the destination nodes; determining a sub-network for implementing the network coding comprising: source nodes which belong only to the second set of source nodes, the plurality of destination nodes, and nodes included in the disjointed paths connecting the source nodes of the second set of source nodes and the destination nodes; and building a network coding scheme based on the determined sub-network.

Abstract: In the field of coding/decoding in telecommunications networks, an error correcting decoder and associated decoding method are adapted to a mesh network. In particular, the system for the decoding of a plurality of coded copies of a data word includes at least a first decoding stage with: a plurality of soft decision decoders, each decoder being arranged for decoding a coded copy received as decoder input, and a graph-based decoder comprising a plurality of nodes, each node of said graph-based decoder receiving the soft output value from a corresponding decoder and the graph-based decoder determining a decoding value of said data word on the basis of said soft output values.

Abstract: A method of decoding a one-point algebraic geometric code defined on an algebraic curve of the kind C(a,b), represented by an equation of degree b in X and of degree a in Y. For any received word, transmission errors affecting the received word are located. The correction of errors in the word, which belongs to an algebraic geometric code, is then reduced to the correction of errors in a certain number, at most equal to a, of words belonging to a Reed-Solomon code. Devices and apparatuses adapted to implement this method are also described.

Abstract: It is proposed a method of decoding a set of symbols to be decoded, several data blocks representative of the set of symbols to be decoded being received by a decoding node of a communications network. The data blocks are encoded by means of an error correction code enabling a decoding by erasure. The decoding node performs the following steps: a first selecting step of selecting at least one of the data blocks, a first determining step of determining first erasures, a checking step of checking whether the number of the first erasures is below a given threshold. In the event of positive determining, the decoding node performs a first decoding step of decoding by erasure of the set of symbols to be decoded. If not it performs a second selecting step of selecting at least one of the data blocks, a second determining step of determining second erasures, and a second decoding step of decoding by erasure of the set of symbols to be decoded from the second erasures.

Abstract: The present invention concerns channel codes particularly well adapted to transmission in channels in which errors tend to occur in bursts. Moreover, the codes according to one embodiment of the invention using an algebraic geometric curve are easy to decode and have a relatively high minimum distance. The invention also relates to the corresponding encoding and decoding methods, as well as the devices and apparatuses adapted to implement those methods. Application is in particular to mass storage, and to systems of communication by OFDM.

Abstract: A method of encoding information symbols comprises a step in which a word v, orthogonal to a matrix H, the element H?? of which is equal to the value taken by some monomial h?=YjXi at the point P? of some locating set, is associated with every block of k information symbols belonging to a Galois field Fq. The method chooses the set of monomials h? so as to define codes which can be decoded with an algorithm by aggregates of low complexity, and which provides a very good error correction capability, in particular for channels in which the errors tend to occur in bursts. Devices and apparatuses adapted to implement this method are also disclosed.

Abstract: The present invention relates to a method of decoding a one-point algebraic geometric code defined on an algebraic curve of type C(a,b) represented by an equation F(X,Y)=0 of degree b in X and of degree a in Y over Fq, comprising the following steps: —calculating extended error syndromes (?j(i)) associated with a received word (r); —determining the values of errors in each component (r(x, yp(x))) of the received word r, on the basis of the extended error syndromes calculated. Since the error value is determined for each component, it is not necessary to have recourse to an error locating step. The invention also relates to devices and apparatuses associated with the method.

Abstract: In order to evaluate the noise related to data issuing from a turbo-encoder, estimates of the noise related to its systematic output, to the data issuing from its first elementary encoder, and to the data issuing from its second elementary encoder are determined. At least two of the estimates of the noise related to the systematic output, to the data issuing from the first encoder, and to the data issuing from the second encoder, are added. The results of these additions are divided by the number of augends added, and then inverted, so as to obtain a noise factor, and the noise factor is multiplied with the data issuing from at least one of the first encoder, second encoder, and systematic output.

Abstract: The present invention concerns a device (10) for the encoding of information symbols to transmit or to record, and for the correction of errors among the symbols received or read, according to codes defined over a Galois field Fq, where q is an integer greater than 2 and equal to a power of a prime number, and in which a set of elements of Fq are considered which are denoted yl(j), where j=1, . . . , R with 1?R?q?1 and l=0, . . . , p?1 with p>1.

Abstract: The present invention concerns an encoding method in which encoding is performed of any information word a of length k in the form of a word ? belonging to a Reed-Solomon code C of dimension k? and length n? (with n??k?=n?k) such that the components of ?? situated in (n??n) arbitrary predetermined positions be systematically equal to respective predetermined constants (for example, all zero). The possibility then exists of deleting those components of fixed value to obtain a word ? of length n belonging to a code C, which thus constitutes a code that is shortened with respect to code C. The invention also relates to devices and apparatuses adapted to implement the encoding method. The invention may be used for encoding by means of an algebraic geometric code, when such encoding may be implemented by encoding by means of a plurality of shortened Reed-Solomon codes.