首页> 外国专利> Method and device for decoding the algebraic-geometric codes at a point, comprises the construction of a sequence of syndromes matrices ending with a zero row elements matrix

Method and device for decoding the algebraic-geometric codes at a point, comprises the construction of a sequence of syndromes matrices ending with a zero row elements matrix

机译:用于在一点上解码代数几何代码的方法和设备,包括构造以零行元素矩阵结尾的校正子矩阵序列

摘要

The method for decoding an algebraic-geometric code at a point of dimension k and length n, in order to identify the position of errors in a received word, defines the syndromes matrix S of dimensions (n-k)-(n-k) whose elements Sij of each row i are computed for j between 1 and w(i), where the boundary w is a decreasing function, on the basis of syndrome s of the received word. The method comprises the construction of matrices Su for successive values of u by beginning with S1 = S, where each matrix Su for u greater than 1 is obtained from the matrix Su-1 by permutating the columns of matrix Su-1 and then by linear manipulations on the row of index u of the obtained matrix. The construction of matrices is terminated when either the matrix elements of row u and column j vanish (Suuj=0) for all j between 1 and w(u), or if there exist an integer uasterisk not greater than u-1 such that the matrix elements of row uasterisk and column j vanish (Suasteriskuasterisk+j=0) for all j between 1 and w(u). The final step is either the step numbered u = lambda, if an integer lambda is determined such that the matrix elements of row lambda and column j vanish (Sapproximatelylapproximatelylj=0) for all j between 1 and w(lambda), or the step numbered u=(lambda-1), if an integer lambda and an integer uasterisk, which is lesser than lambda, are determined so that the matrix elements of row uasterisk and column j vanish (Suasteriskuasteriskj=0) for all j between 1 and w(lambda). The number of rows of each matrix Su is truncated to umax, where umax is the smallest integer i for which w(i) is lesser than i. The number of columns of each matrix Su is truncated to w(u). The number of columns of each matrix Su is truncated to w(muD) for u between 1 and the Duursma minimum muD, and to w(u) for u greater than muD. A device (claimed) implements the method (claimed). A decoder (claimed) comprises at lesat one device as claimed for error correction, and at least one unit for the redundancy suppression. An apparatus (claimed) for the reception of coded digital signals comprises the decoder and means for demodulating the coded digital signals. An information system (claimed) comprises the decoder and at least one hard disc, and means for reading the hard disc. A storage means (claimed) for data comprises the instructions of information program code for executing the steps of the method. A computer program (claimed) comprises instructions required of a programmable data processing device to implement the method.
机译:为了识别尺寸为k和长度为n的点处的代数几何代码的方法,为了识别接收到的单词中的错误的位置,定义了尺寸为(nk)-(nk)的校正子矩阵S,其元素Sij为根据接收到的单词的校正子s,为1和w(i)之间的j计算每行i,其中边界w是递减函数。该方法包括通过以S1 = S开头来构造u的连续值的矩阵Su,其中通过对矩阵Su-1的列进行置换,然后通过线性变换,从矩阵Su-1获得u大于1的每个矩阵Su对获得的矩阵的索引u的行进行操作。当行u和列j的矩阵元素对1和w(u)之间的所有j都消失(Suuj = 0)时,或者如果存在不大于u-1的整数星号,则矩阵的构造终止。对于介于1和w(u)之间的所有j,行uasterisk和列j的矩阵元素都消失(Suasteriskuasterisk + j = 0)。如果确定整数lambda,使得对于介于1和w(lambda)之间的所有j,行lambda和j列的矩阵元素都消失(Sapproximatelylapproximatelylj = 0),则最后一步是步骤u = lambda,或者是步骤编号u =(lambda-1),如果确定一个整数lambda和一个小于lambda的整数uasterisk,以使行uasterisk和j列的矩阵元素消失(Suasteriskuasteriskj = 0),则所有介于1和w( lambda)。每个矩阵Su的行数被截断为umax,其中umax是w(i)小于i的最小整数i。每个矩阵Su的列数被截断为w(u)。对于u在1和Duursma最小muD之间的u,每个矩阵Su的列数被截断为w(muD),对于u大于muD的u,截断为w(u)。设备(已声明)实现了方法(已声明)。解码器(要求保护)至少包括如权利要求1所述的用于纠错的设备,以及至少一个用于冗余抑制的单元。用于接收编码的数字信号的设备(要求保护的)包括解码器和用于解调编码的数字信号的装置。一种信息系统(要求保护),包括解码器和至少一个硬盘,以及用于读取硬盘的装置。用于数据的存储装置(要求保护的)包括用于执行该方法的步骤的信息程序代码的指令。计算机程序(要求保护的)包括实现该方法的可编程数据处理设备所需的指令。

著录项

  • 公开/公告号FR2845220A1

    专利类型

  • 公开/公告日2004-04-02

    原文格式PDF

  • 申请/专利权人 CANON KABUSHIKI KAISHA;

    申请/专利号FR20020012069

  • 发明设计人 LEHOBEY FREDERIC;PIRET PHILIPPE;

    申请日2002-09-30

  • 分类号H04L1/22;H03M13/19;

  • 国家 FR

  • 入库时间 2022-08-21 22:39:25

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号