Abstract:
The invention proposes a method for allocating, to a plurality of elements, authorisations for access to a shared resource, including the step (E4) of storing the address of elements capable of accessing the shared resource, characterised in that it includes the steps of determining (E6), for the plurality of elements, a number (TTJ) of authorisations for access to the resource, the said authorisations together forming a cycle, then successively assigning (E8, E80) each of the said authorisations to the elements, during the said cycle, an access authorisation being assigned to an element according to at least the number of times the element under consideration accessed the resource during the preceding cycle, and finally storing (E88, E890) the number of times each element accesses the resource during the said cycle.
Abstract:
A method of transmitting binary data by a sender to a receiver over a transmission channel includes a formatting function integrated with a function of external coding of the binary data. The method applies in particular to the case where the sender uses a turbocoder with an interleaver of the “x to xe” type, and where the receiver uses a turbodecoder with an interleaver of the “x to xe” type.
Abstract:
A transmitting apparatus transmits a plurality of data packets to a receiver in a communication system, by transmitting one or more data packets from a list of data packets to be transmitted, and determining whether an acknowledgment is received for each transmitted data packet. When it is determined that an acknowledgement has not been received for at least one data packet, referred to as an unacknowledged data packet, the apparatus selects one or more additional data packets from the list of data packets to be transmitted, generates 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, and transmits at least one of the generated parity packets.
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:
A method of decoding product codes is disclosed, in which the symbols of each codeword may be placed in a table comprising n2 rows and n1 columns, such that the symbols constituting each row form a permitted word of length n1 according to a first component code able to be decoded by means of an algorithm A1 for correction with erasures, and the symbols constituting each column form a permitted word of length n2 according to a second component code able to be decoded by means of an algorithm A2 for correction with erasures. According to the method, a correction of a row or column is only accepted when the result of the correction is deemed reliable, otherwise all the symbols of that row or column are erased. Devices and apparatus adapted to implement this method are also disclosed. The method is preferably applied to algebraic geometric codes.
Abstract:
The present invention concerns a method of coding information symbols according to a code defined on a Galois field Fq, where q is an integer greater than 2 and equal to a power of a prime number, and of length n=p(q−1), where p>1. This coding is designed so that there exists a corresponding decoding method, also disclosed by the invention, in which the correction of transmission errors essentially comes down to the correction of errors in p words of length (q−1) coded according to Reed-Solomon. The invention is particularly advantageous when, through a suitable choice of parameters, the code according to the invention is an algebraic geometric code: in this case, it is possible to correct the transmission errors by the method already mentioned and/or by a conventional method which is less economical but has a higher performance. The invention also concerns devices and apparatus intended to implement these coding and decoding methods. Application in particular to mass storage, and to the transmission of images coded at source.
Abstract:
The coding method to which the present invention relates takes into account at least one selection criterion related to a transmission of binary symbols representing a physical quantity, for selecting at least one transmission parameter. Each said selected transmission parameter is in the set of parameters comprising: a number K, greater than or equal to 1, of sequences ai (i=1, . . . , K) of binary symbols, to be coded, an integer M1, equal to or greater than 2, a divisor polynomial gi(x), an integer M, an interleaver, and a multiplier polynomial fij(x). It uses an interleaver which maintains the divisibility by a polynomial gi(x).
Abstract:
The present invention proposes a method and a device for detecting, amongst a set of signals, the presence of a periodic signal of period of occurrence T, in which a signal discriminating the said signal in the said set of signals is delivered. According to the invention, the discrimination signal is sampled in ln samples over more than one period T, a state value B(i) representing its level, and a true correlation value SR is calculated, by cumulating, for pairs of samples i and i+Z, the instantaneous value of correlation between the state value B(i) and the state value B(i+Z), the samples i and i+Z being located at instants shifted by a period T. Then, for said pairs od samples, the rate r of samples having the said signal over the total number of samples is measured, at least one so-called "theoretical correlation average" value is determined, and the true correlation value SR is compared with each theoretical correlation average value and from this the presence or absence of the signal to be detected is deduced.