Abstract: A method is provided for encoding an input digital message bearing K information symbols using a turbo-encoder forming a turbocode, the turbo-encoder including an interleaver and first and second encoders for encoding according to at least one elementary code and delivering the information symbols and redundancy symbols. With a puncturing of the symbols delivered by the turbo-encoder being done according to at least one periodic puncturing pattern of a length N, defining the puncturing period N, the interleaver distributes the information symbols of the input message into Q layers of the interleaved input message in complying with an interleaving function defined from the at least one puncturing pattern, according to the relationship: ?(i)=Pi+S(i mod Q)mod K=Pi+(Tl+AlQ)mod K.

Abstract: The present invention relates to a method for managing packets in a network of Information Centric Networking (ICN) nodes (1, 2a, 2b, 2c, 2d, 2e), the method comprising: —at a first node (1), performing steps of: ? Receiving a request (i) for a data packet (C), and if the data packet (C) is stored, responding to the request (i) by forwarding the data packet (C); otherwise ? sending to at least one neighboring node (2a, 2b) of the network a request (i?) for meta-data packets (@), a meta-data packet (@) indicating availability of said data packet (C) at a target node; ? receiving in response at least one meta-data packet (@), so as to identify at least one target node (2c, 2e) wherein said data packet (C) is available; ? forwarding the request (i) for said data packet (C) toward one selected target node (2c); —at a second node (2a, 2b, 2c, 2d, 2e), performing steps of: ? Receiving a request (i?) for meta-data packets (@), and if the data packet (C) is stored, responding to the request (i?) by forwarding a meta-

Abstract: There is provided a decoder (310) for sequentially decoding a data signal received through a transmission channel in a communication system, the received data signal carrying transmitted symbols, the decoder comprising a symbol estimation unit (311) configured to determine estimated symbols representative of the transmitted symbols carried by the received signal from information stored in a stack, the stack being filled by iteratively expanding child nodes of a selected node of a decoding tree comprising a plurality of nodes, each node of the decoding tree corresponding to a candidate component of a symbol of the received data signal and each node being associated with a predetermined metric, the stack being filled at each iteration with at least some of the expanded child nodes and being ordered by increasing values of the metrics associated with the nodes, the selected node for each iteration corresponding to the node having the lowest metric in the stack.

Abstract: The invention relates to a system and a method for transmission over optical fiber (130) with mode or core scrambling. The system comprises a spatio-temporal encoder (110) and a plurality of modulators (1251, . . . , 125n) associated, respectively, with separate propagation modes or cores of said fiber, each modulator modulating a laser beam. Said fiber comprises a plurality of slices (1301, . . . , 130L), an amplifier (140l) being provided between any two consecutive slices of the optical fiber. A mode scrambler (150l) is associated with each amplifier in order to perform a permutation of said modes between at least two consecutive slices.

Abstract: A decoder or a decoding method for decoding a data signal is provided by iteratively constructing a decoding tree comprising nodes, each representing a component of a symbol of a data signal, each iteration comprising, for a current node of the tree stored in the top of the stack; generating a reference child node of the current node from the data signal; from the reference child node, generating a first and second neighbor child nodes by subtracting/adding a positive integer parameter from/to the value of the reference node; storing in the stack three child nodes derived from the reference, first and second neighbor child nodes, the nodes stored in the stack being ordered by increasing values of a node metric; removing the current node stack; selecting the top node of the stack as the new current node. The data signal is estimated from the stack node information.

Abstract: A method for detecting if an online review written by a user on a website of a telecommunications network is a spam, using at least one previously-labeled review, a review dataset comprising at least one review to be analyzed, and a spam feature list listing different features of spam reviews, method wherein: a) a weight is computed for each spam feature of the spam feature list, corresponding to the importance of the spam feature in the detection of spam reviews, and based at least on the features of said at least one previously-labeled review, and b) a probability of being a spam for a review under analysis in the review dataset is computed by using at least the weights of the spam features computed at step a) and a comparison between the features of said review under analysis and the ones of at least one review previously-labeled as spam.

Abstract: A method of communicating a classical message M between a first party A and a second distant party B over a public channel F, comprises the steps of sharing a key between the parties, the shared key K comprising a short-term-secure key KS and/or a long-term-secure key KL; at A, encoding M as a quantum codeword, A using K to encode M into a first encrypted codeword belonging to a publicly known quantum code; communicating the first encrypted codeword from A to B over F whose output is a second codeword; unitarily transforming the second codeword into a third codeword by using a N-mode interferometer controlled by B, placed at the output of F and keyed by K; determining an estimate of M, at B, by performing a measurement on the third codeword and by processing the measurement using K.

Abstract: Embodiments of the invention provides a deterministic scrambler (1) arranged in a multimode optical fiber (130) for scrambling light, the light comprising a set of optical signals propagated in said multimode optical fiber according to a set of propagation modes, each propagation mode being associated with a power value, wherein the scrambler is configured to determine a permutation of said propagation modes depending on the power values associated with said propagation modes, the scrambler being configured to redistribute the optical signals according to said permutation of the propagation modes.

Abstract: A method for processing an intrusion in a communication network including a plurality of node equipment, including a current node, which: discovers of a neighborhood of the current node, including assigning a resilience group to the neighboring node, according to at least one piece of information representative of a resilience level of the neighboring node to at least one type of attack; detecting an intrusion affecting at least one suspect node of the neighborhood of the current node; establishing a consensus concerning the at least one suspect node in a neighborhood by counting a number of resilience groups having detected the intrusion in the neighborhood of the suspect node and a total number of resilience groups represented in the neighborhood of the suspect node; and deciding to change a status of the suspect node based on a result of the consensus by comparison of both numbers.

Abstract: The present invention relates to a method of simplifying a geometry model, the method comprises: determination (607) of an integral error rating QiS defined as being a function of a sum of the error measures associated with the points of the plurality having a lower associated Morton code than the Morton code associated with the current point; determination (614) if a given set of points of the plurality can be simplified by a new point, the points of the given set all being the points of the plurality having a Morton code associated with one and the same prefix of given length, as a function at least of a difference between: —the integral error measure QlasS determined for the point of the given set having the largest Morton code (las); and—the integral error measure Qini-1S determined for the point of the plurality having an immediately lower Morton code (ini?1) than the smallest Morton code out of the Morton codes associated with the points of the set.

Abstract: A method of selecting, for at least one service of an information system and depending service(s), at least one countermeasure to be implemented against at least one cyber attack, the method includes: identifying elements of the service exposed to the cyber attack(s), calculating a risk mitigation level of each countermeasure with respect to the cyber attack(s), ranking the countermeasure(s) on the basis of a parameter which is at least a function of the risk mitigation level, simulating the impact of the countermeasure(s) on the service and the depending service(s), the countermeasure to be implemented being selected at least as a function of result of the simulation.

Abstract: A receiver for Filter Bank Multicarrier frequency spread signals such as FBMC, FBMC/OQAM, OFDM, comprises a linear phase rotation module adapted to introduce a linear phase rotation to a received time domain signal, a discrete Fourier transform and a Finite Impulse response digital filter. The coefficients of the digital filter define a shift of the frequency response of the prototype filter of the receiver, and the coefficients of the digital filter are fixed so as to compensate the linear phase rotation introduced by the filter. The frequency shift introduced may be equal to the reciprocal of a power of two of the modulation sub carrier spacing.

Abstract: The method of assisting the production of an implantable unfurlable made to measure device comprises: three-dimensional reconstruction of a complex surface of the cavity in which the device will be implanted; Production of a first finite element mesh of this complex surface; Choosing of generic components of the device; Production of a second finite element mesh of these assembled generic components; Determination of the morphosis parameters for morphosing from the first mesh to a mesh of a set of simple linked volumes which is representative of the part of the cavity, and then deformation of the first mesh by this morphosis; Simulation of a deformation of the second mesh, by inverse morphosis dependent on the determined parameters, to the complex surface, simulating unfurling of the device; Determination of dimensioning of points of interest by projection onto the second deformed mesh; and Generation of a production blueprint plan of the device.

Abstract: System for testing a protocol, which is active on an item of equipment, testing system including a monitor to continuously capture traces, corresponding to sequences of messages of protocol under test, a filter of the traces captured using formalized properties of the demands of protocol under test, to separate the traces into data and control parts, a temporary storage, and transfer module to transfer the filtered traces to a tester so as to emit verdicts by verifying whether the traces satisfy the demands of the formalized properties of the protocol under test, in the event of saturation of the tester leading to the emission of a notification of load, the transfer module interrupts the transfer of filtered traces to the tester and stores the traces at least partially in the temporary storage, particularly only their control parts, before resuming the transfer of filtered traces when the tester is again available.

Abstract: The invention relates to a MAP decoding method of a signal received through a noisy channel, the signal being composed of symbols in an alphabet having a non-uniform probability distribution, the symbols being represented by points in a lattice (?). The probability distribution of symbols is modeled using a Gaussian distribution. An augmented lattice (?exp) is formed from the lattice (?) and the ratio (?) between variance of the noise and variance of the Gaussian distribution of symbols. Therefore, the disclosed MAP decoding method consists essentially of decoding using an ML criterion searching the point in the augmented lattice closest to the point representative of the received signal (yexp).

Abstract: Embodiments of the invention provide a decoder (10) for decoding a signal received through a transmission channel in a communication system, the signal carrying information symbols selected from a given set of values and being associated with a signal vector, the transmission channel being represented by a channel matrix. The decoder comprises: a sub-block division unit (12) configured to divide the received signal vector into a set of sub-vectors in correspondence with a division of a matrix related to said channel matrix; at least one weighting coefficient calculation unit (14) configured to calculate a sub-block weighting coefficient for each sub-vector, at least one symbol estimation unit (11) for recursively determining estimated symbols representative of the transmitted symbols carried by the data signal from information stored in a stack.

Abstract: Embodiments of the invention provide a decoder for decoding a signal received through a transmission channel in a communication system, said signal comprising a vector of information symbols, said transmission channel being represented by a channel matrix, wherein the decoder comprises: an initial radius determination unit (307) configured to determine an initial radius; a symbol estimation unit (309) configured to iteratively determine a current radius to search a lattice point inside a current spherical region defined by said current radius, said current radius being initially set to said initial radius, said symbol estimation unit (309) being configured, for each lattice point found in said current spherical region, to store said lattice point in association with a metric, said symbol estimation unit (309) being further configured to update said current radius using a linear function, said linear function having a slope parameter strictly inferior to one, The decoder being configured to determine at

Abstract: The representation of content, in a scene representation, is enriched with a view to the adaptive use of the latter according to a set of common parameters. A sub-graph of the scene graph, which is susceptible to variable processing, is identified. For this purpose, two new types of scene element can be defined, one of which allows the identification of the sub-graph and the second enables application of the set of common parameters in relation to the sub-graph. An example of the first type is a node of so-called “AdaptivityControl” type which encompasses the entire sub-graph, a list of the nodes describing the set of common parameters and a group of fields for dynamic updating of the content of this node. An example of the second type is a node of so-called “CompressedImageStrategy” type which comprises information relating to the object to be coded and the coding parameters.

Abstract: Power allocation in NOMA systems for example on the basis Proportional Fairness calculations depends on knowledge of user throughput on a specified sub-band, which implies that users have already been allocated to particular sub-bands. Meanwhile, maximum throughput can generally be achieved where there is the greatest possible difference in transmission power for the users on a given sub-band, so that optimal allocation of users to sub-bands requires knowledge of the power available for each user.

Abstract: Embodiments of the invention provide a decoder for decoding a signal received through a transmission channel in a communication system, said signal comprising a vector of information symbols, wherein the decoder comprises: a processing unit (307) configured to determine at least one candidate set of division parameters and to perform a division of said vector of information symbols into a set of sub-vectors in association with each candidate set of division parameters, each pair of sub-vectors being associated with a division metric; a selection unit (309) configured to select one of said candidate sets of division parameters according to a selection criterion depending on said division metric; and a decoding unit (311) configured to determine at least one estimate of each sub-vector associated with said selected set of division parameters by applying a symbol estimation algorithm, wherein the decoder is configured to determine at least one estimate of the vector of information symbols from said at least