公开(公告)号：US07398456B2

公开(公告)日：2008-07-08

申请号：US10565280

申请日：2004-07-21

Applicant: Philippe Piret ,  Philippe Le Bars ,  Frederic Lehobey

Inventor： Philippe Piret ,  Philippe Le Bars ,  Frederic Lehobey

IPC: H03M13/00

CPC classification number: H03M13/159 ,  H03M13/1515 ,  H03M13/1535 ,  H03M13/155

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.

Abstract translation: 本发明涉及一种编码方法，其中以属于尺寸k'和长度n'（n'-k'）的Reed-Solomon码C的单词nu的形式的任何长度为k的信息字a执行编码， = nk），使得位于（n'-n）任意预定位置的nu'的分量系统地等于相应的预定常数（例如，全零）。 然后存在删除固定值的那些分量的可能性以获得属于代码C的长度为n的字nu，这样构成相对于代码C被缩短的代码。本发明还涉及适于实现的设备和装置 编码方法。 本发明可以用于通过代数几何码的编码，当这种编码可以通过借助于多个缩短的里德 - 所罗门码的编码来实现时。

公开(公告)号：US07392461B2

公开(公告)日：2008-06-24

申请号：US11034009

申请日：2005-01-13

Applicant: Philippe Piret ,  Frédéric Lehobey ,  Philippe Le Bars

Inventor： Philippe Piret ,  Frédéric Lehobey ,  Philippe Le Bars

IPC: H03M13/00

CPC classification number: H03M13/132

Abstract: The present invention concerns a method and apparatus of decoding a one-point algebraic geometric code defined on an algebraic curve represented by an equation in X and Z of degree 2μφ in Z, where φ is a strictly positive integer and μ an integer greater than 1, obtained by taking the fiber product of μ component algebraic equations, each of said component equations governing the unknown X and an unknown Yi, where i=0, . . . , μ−1, and being of degree 2φ in Yi. This method comprises the decoding of 2(μ−1)φ “clustered” codes, all defined on the same algebraic curve represented by one of said component equations.

Abstract translation: 本发明涉及一种解码在由Z中的程度2 Muphi 的X和Z表示的代数曲线上定义的一点代数几何代码的方法和装置，其中phi是严格正数 通过获取μ分量代数方程的纤维积，通过控制未知X的每个组分方程和其中i = 0的未知Y i i，得到整数和μa大于1的整数。 。 。 ，mu-1，并且在YII中具有2级的phi 。 该方法包括对由所述分量方程之一表示的相同代数曲线上定义的2（μ-1）个“聚集”码的解码。 本发明还涉及适于实现该方法的装置和装置。

公开(公告)号：US07256717B2

公开(公告)日：2007-08-14

申请号：US11179623

申请日：2005-07-13

Applicant: Philippe Piret ,  Arnaud Closset ,  Laurent Frouin

Inventor： Philippe Piret ,  Arnaud Closset ,  Laurent Frouin

IPC: H03M5/00

CPC classification number: H04L25/4906 ,  H03M5/145 ,  H04L25/493

Abstract: A method for encoding and decoding a sequence of words, corresponding signal, encoder, decoder, computer programs and storage means. A method for encoding a sequence of source words includes a step of selecting an encoding function to be applied to a source word to be encoded as a function of the content of the word to be encoded and of at least one preceding source word in the sequence so that the concatenation of two consecutive encoded words has no binary element, called an isolated binary element, sandwiched between two binary elements with a value different from that of the isolated binary element. The method further includes a step of encoding the word to be encoded implementing the selected encoding function.

Abstract translation: 一种用于对字序列，对应信号，编码器，解码器，计算机程序和存储装置进行编码和解码的方法。 用于编码源字序列的方法包括以下步骤：根据要编码的字的内容和序列中的至少一个在前的源字选择要应用于要编码的源字的编码功能的步骤 使得两个连续编码字的级联没有被称为隔离二进制元素的二进制元素，其被夹在具有与隔离二进制元素的值不同的值的两个二进制元素之间。 该方法还包括编码实现所选编码功能的要编码的单词的步骤。

公开(公告)号：US20060227017A1

公开(公告)日：2006-10-12

申请号：US10565280

申请日：2004-07-21

Applicant: Philippe Piret ,  Philippe Le Bars ,  Frederic Lehobey

Inventor： Philippe Piret ,  Philippe Le Bars ,  Frederic Lehobey

IPC: H03M7/00

CPC classification number: H03M13/159 ,  H03M13/1515 ,  H03M13/1535 ,  H03M13/155

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.

Abstract translation: 本发明涉及一种编码方法，其中以属于尺寸k'和长度n'（n'-k'）的Reed-Solomon码C的字nu的形式的任何长度为k的信息字a执行编码， = nk），使得位于（n'-n）任意预定位置的nu'的分量系统地等于相应的预定常数（例如，全零）。 然后存在删除固定值的那些分量的可能性以获得属于代码C的长度为n的字nu，这样构成相对于代码C被缩短的代码。本发明还涉及适于实现的设备和装置 编码方法。 本发明可以用于通过代数几何码的编码，当这种编码可以通过借助于多个缩短的里德 - 所罗门码的编码来实现时。

公开(公告)号：US20050257115A1

公开(公告)日：2005-11-17

申请号：US11034009

申请日：2005-01-13

Applicant: Philippe Piret ,  Frederic Lehobey ,  Philippe Le Bars

Inventor： Philippe Piret ,  Frederic Lehobey ,  Philippe Le Bars

IPC: H03M13/13 ,  H03M13/00

CPC classification number: H03M13/132

Abstract: The present invention concerns a method of decoding a one-point algebraic geometric code defined on an algebraic curve represented by an equation in X and Z of degree 2μφ in Z, where φ is a strictly positive integer and μ an integer greater than 1, obtained by taking the fiber product of μ component algebraic equations, each of said component equations governing the unknown X and an unknown Yi, where i=0, . . . , μ−1, and being of degree 2φ in Yi. This method comprises the decoding of 2(μ−1)φ “clustered” codes, all defined on the same algebraic curve represented by one of said component equations. The invention also relates to devices and apparatuses adapted to implement this method.

Abstract translation: 本发明涉及一种解码在由Z中的程度2“Muphi”的X和Z表示的代数曲线上定义的一点代数几何码的方法，其中phi是严格正整数， 通过获取μ分量代数方程的纤维积，通过控制未知X的每个组分方程和其中i = 0的未知Y i i获得μ大于1的整数。 。 。 ，mu-1，并且在YII中具有2级的phi 。 该方法包括对由所述分量方程之一表示的相同代数曲线上定义的2（μ-1）个“聚集”码的解码。 本发明还涉及适于实现该方法的装置和装置。

公开(公告)号：US20050210357A1

公开(公告)日：2005-09-22

申请号：US11085129

申请日：2005-03-22

Applicant: Philippe Piret ,  Frederic Lehobey ,  Philippe Le Bars

Inventor： Philippe Piret ,  Frederic Lehobey ,  Philippe Le Bars

IPC: H03M13/00 ,  H03M13/15

CPC classification number: H03M13/132

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 invention shows how to choose the set of said 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. The invention also relates to devices and apparatuses adapted to implement this method.

Abstract translation: 编码信息符号的方法包括一个步骤，其中与矩阵H正交的单词“U STYLE =”SINGLE“> v，其元素H字母表等于某些 某些定位集的点P“β”处的单项式αx i = i i i i i i / 属于伽罗瓦域F k的k个信息符号的块。 本发明示出了如何选择所述单项式的集合，以便定义可以通过低复杂度的聚合使用算法解码的代码，并且其提供非常好的纠错能力，特别是 对于错误倾向于在突发中发生的通道。 本发明还涉及适于实现该方法的装置和装置。

公开(公告)号：US06638318B1

公开(公告)日：2003-10-28

申请号：US09434402

申请日：1999-11-05

Applicant: Philippe Piret ,  Claude Le Dantec

Inventor： Philippe Piret ,  Claude Le Dantec

IPC: H03M1300

CPC classification number: H03M13/2757 ,  G06T9/001 ,  H03M13/2993

Abstract: The coding method to which the present invention relates takes into account: a polynomial without square g(x), N0, the smallest integer such that g(x) is a divisor of the polynomial xN0+1; n, an odd multiple of N0; a sequence u of n symbols ui to be coded; and e, a power of 2 different from 1, which is residue of e modulo N0 is equal to 1. It includes: an operation of forming a concatenated sequence uu* (304) consisting successively of the sequence u and a sequence of symbols u* such that u*(x)=u(xe) modulo xn+1, an operation of coding the concatenated sequence uu* (305), including at least one division of the concatenated sequence uu* by the polynomial g(x).

Abstract translation: 本发明涉及的编码方法考虑到：无方格g（x）的多项式，N0，最小整数，使得g（x）是多项式x

公开(公告)号：US06542553B1

公开(公告)日：2003-04-01

申请号：US08994325

申请日：1997-12-19

Applicant: Claude Le Dantec ,  Philippe Piret

Inventor： Claude Le Dantec ,  Philippe Piret

IPC: H04L2302

CPC classification number: H04L1/0057 ,  H04L1/0042 ,  H04L1/0047

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 translation: 发送装置具有适于将第一字母表的每个符号映射到属于具有Q个符号的第二字母的次数字数据的标签装置，Q严格地大于P，其中，第二字母表中的P个符号仅表示一个且仅一个符号 的第一个字母表。 编码器使用考虑到辅助数字数据的编码规则来确定属于第二字母表的冗余数据。 发射机将物理量调制成一系列信号，每个信号能够获取不同值的数字P，并且根据连续表示要发送的数字数据的传输规则和冗余数据。

公开(公告)号：US06404360B1

公开(公告)日：2002-06-11

申请号：US09699499

申请日：2000-10-31

Applicant: Philippe Piret ,  Claude Le Dantec

Inventor： Philippe Piret ,  Claude Le Dantec

IPC: H03M700

CPC classification number: H03M13/2993 ,  H03M13/271 ,  H03M13/2957

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 translation: 本发明涉及用于交织形成发送或接收方法的一部分的数据的方法和装置。 更具体地，本发明的目的是一种交织和解交织方法，旨在形成所谓的“turbo编码”方法和相关联的转发方法的一部分，目的是为turbo编码器提出更有效的交织器，也就是说 说可以获得更大的代码最小距离。

公开(公告)号：US06301307B1

公开(公告)日：2001-10-09

申请号：US08994437

申请日：1997-12-19

Applicant: Claude Le Dantec ,  Philippe Piret

Inventor： Claude Le Dantec ,  Philippe Piret

IPC: H04L2302

CPC classification number: H04L1/0057 ,  H04L1/0041 ,  H04L1/0045

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 translation: 用于发送数字数据的装置包括选择器，其选择彼此相邻的某些数字数据对，映射器，其根据一组规则将选择的每个数字数字耦合到幅度耦合，以及发送器 正交信号，这种信号的两个分量分别由幅度耦合的第一和第二幅度调制。 映射规则集包括一个规则，该规则规定当传输发生之后两个振幅耦合将被混淆的估计概率大于某一值时，对应于两个幅度对的数字数据耦合具有第一或 第二个数字数据项的值相同。