Abstract: To interleave a binary sequence a represented by a polynomial 1 a ⁡ ( x ) = ∑ i = 0 n - 1 ⁢ a i ⁢ x i ,

Abstract: The decoding method to which the present invention relates takes into account: at least one predetermined polynomial, and a received sequence r capable of being the result of the coding of a sequence of information symbols of polynomial representation u(x) representing a physical quantity, the coding including a turbocoding, and guaranteeing the divisibility of a sequence to be turbocoded, a(x) representing the sequence u(x), by each predetermined polynomial, This method includes: an operation of turbodecoding (601) the received sequence r into an estimated sequence â, at least one operation of calculating the remainder (602, 606) of the division of the polynomial representation â(x) of the estimated sequence â, by a said predetermined polynomial.

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: The encoding method to which the present invention relates takes into account a serial turbo-encoding having at least one permutation operation which retains the divisibility of polynomial representations of sequences by predetermined polynomials and a convolutional encoding operation which includes a division by such a predetermined polynomial.

Abstract: A method of transmitting information on a transmission channel associated with a first numerical alphabet that takes into account a matrix n×n with an orthogonal dominant H on a second numerical alphabet including at least three different non-null values, and a set of at least one sub-matrix of the matrix H, each sub-matrix of the set containing a number p greater than or equal to 2 rows of the matrix H. A sub-matrix from the set of sub-matrixes is selected along with a p-tuple of real numbers referred to as a “row of coefficients”, such that the matrix product of the row of coefficients and the selected sub-matrix supplies a sequence of numbers of the first alphabet, in order to represent the information to be transmitted. In addition to being orthogonal, matrix H is preferentially balanced.

Abstract: A method is provided for coding information representing a physical quantity and represented by first binary symbols, having an operation of calculating second binary symbols from the information, the second binary symbols being called calculated binary symbols and being provided in order to be disposed in a square table. For each calculated binary symbol, there exist at least three distinct diagonals in the table which contain this calculated binary symbol and which, deprived of this calculated binary symbol, still allow each one on its own to recalculate the calculated binary symbol. A coding device, a decoding method, a decoding device, a transmission method, and a transmission device are provided, as well as a camera, a facsimile machine, photographic apparatus, and a computer, implementing the invention.

Abstract: A transmission device has labeling means adapted to map each symbol of a first alphabet to secondary digital data belonging to a second alphabet having Q symbols, Q being strictly greater than P, wherein P symbols of the second alphabet each exclusively represent one and only one symbol of the first alphabet. A coder determines redundant data belonging to the second alphabet, using coding rules that take into account the secondary digital data. A transmitter modulates a physical quantity into a series of signals each capable of taking a number P of different values, and according to transmission rules successively representing the digital data to be transmitted and the redundant data.

Abstract: A method of sending information includes sending, on a transmission channel, sequences of symbols. The sequences are of a fixed length that is not a multiple of 4 and are taken from a collection of sequences, at least three of which are orthogonal in pairs and such that any pair of sequences that is not orthogonal to each other comprises opposite sequences. The symbols are taken from an alphabet of non-nil integers.

Abstract: The information coding device has: a first labeling means adapted to associate, with the information to be coded, K “initial” first degree polynomials, a coding means which performs a polynomial calculation: to form K “coded” sequences of P, greater than or equal to K, “coded” polynomials, the first being equal to one of the K initial polynomials and the others to the product of the preceding polynomial and a predetermined polynomial, and to form a “resultant” sequence of P “resultant” polynomials respectively equal to the sums of the coded polynomials of same rank of the K coded sequences, a second one-to-one labeling means adapted to label the points of a quadrature amplitude modulation signal constellation with the Q2 resultant polynomials, for two adjacent points of the constellation, the polynomials labeling them have one identical coefficient and the other coefficient differing only by 1 modulo Q, and a modulator for quadrature amplitude

Abstract: Turbocoding methods use a first RSC coder operating on sequences of binary data a, and a second RSC coder operating on binary sequences a* each obtained from a by means of a predetermined permutation. These permutations are designed so that, for any sequence a represented by a polynomial divisible by the recursion polynomial, the associated sequence a* is also represented by a polynomial divisible by said recursion polynomial. These permutations are relatively simple to implement, and are applicable to all the data sequences a whose length is a multiple of the period of the recursion polynomial. In addition, once the transfer functions of said coders and said sequence length have been chosen, it is possible to select, amongst the corresponding permutations, the one which will probably offer the highest minimum distance of the code. Application to devices and apparatus implementing these methods.

Abstract: The information transfer method uses: an alphabet Z2t={0, 1, 2, . . . 2t−1}, t≧3, in which additions and multiplications are carried out modulo 2t, and a lifted Hamming code whose generator polynomial is in Z2t. It includes: coding (302) of the information by a sequence of words of the said code, labelling (303), each letter of the alphabet Z2t labelling a letter of an alphabet A, for two adjacent symbols of A, one of the labels is the residue modulo 2t of the other incremented by 1, for each word of the said code, transmission (305) of signals, a physical quantity of which is proportional to the elements of A labelled by each of the symbols of the words of the said code.

Abstract: The invention concerns a method and device for interleaving data forming part of a transmission or reception method. More particularly, the object of the present invention is an interleaving and deinterleaving method, intended to form part of a so-called “turbocoding” method and the associated turbodecoding method, with the aim of proposing more efficient interleavers for a turbocoder, that is to say ones making it possible to obtain a greater minimum distance for the code.

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 coding device that supplied code words, the symbols of which are capable of modulating a physical quantity on a transmission channel making use of symbols of a first alphabet. The decoding of these words uses symbols of a second alphabet containing the first alphabet, the cardinal of the second alphabet being strictly greater than that of the first alphabet and not being an integer power of the cardinal of the first alphabet. The coding device has an input of the “primary” symbols belonging to the first alphabet, a processor which determines redundant symbols capable of allowing decoding of the code words formed from primary symbols and redundant symbols, by a decoder working on the second alphabet, and solves a system of equations expressing the constraints to be met so that the redundant symbols are in the first alphabet, and an output of the symbols of the code words.

Abstract: A coding method for padding K information sequences ui (i=1, 2, . . . , K) to produce K+M1 binary sequences ai (i=1, 2, . . . , K) and ci (i=1, 2, . . . , M1) so that the sequences ai are divisible by a set of K predetermined generator polynomials gi(x) (i=1, 2, . . . , K) each dividing (XN0+1) and the M1 sequences ci are obtained in a calculation involving permutations of the sequences ai (i=1, 2, . . . , K); the permutations having the property of transforming a cyclic code of length N0 with generator polynomial gi(x) to an equivalent cyclic code with a predetermined generator polynomial gij(x).

Abstract: In order to decode a sequence &agr;=(&agr;1, . . . , &agr;i, . . . , &agr;n) where &agr;i is the received electrical signal corresponding to a transmitted signal ai representing the ith binary element vi of a word v=(v1, . . . , Vn) chosen in a code C of words satisfying v·hT=0, where h is a row n-tuplet on the set {0,1}, whose number of 1 is denoted w, an item of extrinsic information &rgr;ext[A(i,h)]=P[ai=−1|A(i,h)]/P[ai+1|A(i,h)] is determined on each of the elements vi covered by h, A(i,h) being the set of the received values &agr;j covered by h, with the exception of &agr;i, and P[ai|A(i,h)] being the probability that the ith signal transmitted was ai. This gives &rgr;ext[A(i,h)]=[S1(i)+S3(i)+ . . . ]/[1+S2(i)+S4(i)+ . . .

Abstract: A device for transmitting digital data includes a selector which selects certain digital data couples which follow each other, a mapper, which, in accordance with a set of rules, maps each digital data couple selected to an amplitude couple, and a transmitter which transmits a signal in quadrature, the two components of such signal being modulated by the first and second amplitudes, respectively, of the amplitude couple. The set of mapping rules includes a rule that states that when the estimated probability that two amplitude couples will be confused, after the transmission has occurred, is greater than a certain value, then the digital data couples corresponding to the two amplitude couples have first or second digital data items whose value is the same.

Abstract: In order to encode an original sequence of binary data (u), a first padding operation (508) is performed, supplementing the original sequence (u) so that the supplemented sequence (u) is divisible by a first divisor polynomial; a first recursive convolutional encoding operation (508) is performed, using the first divisor polynomial, encoding the supplemented original sequence (u); an interleaving operation (506) is performed, permuting the binary data in the original sequence (u) by means of a specific permutation, so as to obtain an interleaved sequence (u*); a second padding operation (510) is performed, supplementing the interleaved sequence (u*) so that the supplemented interleaved sequence (u*) is divisible by a second divisor polynomial (g2); and a second recursive convolutional encoding operation (510) is performed, using the second divisor polynomial, encoding the supplemented interleaved sequence (u*).