Algorithm for computing minimum distance

被引：2
|
作者：
Garcia-Villalba, LJ
Rodriguez-Palánquex, MC
Montoya-Vitini, F
机构：
[1] CSIC, Inst Fis Aplicada, Dept Tratamiento Informac & Codificac, E-28006 Madrid, Spain
[2] Univ Complutense Madrid, Escuela Univ Estadist, Secc Dept Matemat Aplicada, E-28040 Madrid, Spain
来源：
ELECTRONICS LETTERS | 1999年 / 35卷 / 18期
关键词：
D O I：
10.1049/el:19991017
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
A new class of curves, the so-called quasi-Hermitian curves, on F-q (with q = 2(j)) are presented. An algorithm which enables the exact minimum distance for the corresponding Goppa codes to be determined is also presented. This work leads to the possibility of constructing new versions of such codes.
引用
收藏
页码：1534 / 1535
页数：2
相关论文
共 50 条
  • [31] Algorithm 1033: Parallel Implementations for Computing the Minimum Distance of a Random Linear Code on Distributed-memory Architectures
    Quintana-Orti, Gregorio
    Hernando, Fernando
    Igual, Francisco D.
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2023, 49 (01):
  • [32] Computing the minimum distance of linear codes by the error impulse method
    Berrou, C
    Vaton, S
    Jézéquel, M
    Douillard, C
    GLOBECOM'02: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-3, CONFERENCE RECORDS: THE WORLD CONVERGES, 2002, : 1017 - 1020
  • [33] Computing minimum distance between two implicit algebraic surfaces
    Chen, Xiao-Diao
    Yong, Jun-Hai
    Zheng, Guo-Qin
    Paul, Jean-Claude
    Sun, Jia-Guang
    COMPUTER-AIDED DESIGN, 2006, 38 (10) : 1053 - 1061
  • [34] On the De Boer-Pellikaan method for computing minimum distance
    Tohaneanu, Stefan O.
    JOURNAL OF SYMBOLIC COMPUTATION, 2010, 45 (10) : 965 - 974
  • [35] COMPUTING THE MINIMUM VISIBLE VERTEX DISTANCE BETWEEN 2 POLYGONS
    AGGARWAL, A
    MORAN, S
    SHOR, PW
    SURI, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 382 : 115 - 134
  • [36] A SYSTEMATIC METHOD FOR COMPUTING THE MINIMUM FREE DISTANCE OF A CONVOLUTIONAL CODE
    BOUTROS, YZ
    FIANI, GP
    LOOKA, ES
    ENGINEERING FRACTURE MECHANICS, 1993, 46 (04) : 701 - 708
  • [37] EFFICIENT ALGORITHM FOR COMPUTING FREE DISTANCE - COMMENTS
    LARSEN, KJ
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (04) : 577 - 579
  • [38] A hierarchy distance computing based clustering algorithm
    School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China
    不详
    不详
    Jisuanji Xuebao, 2007, 5 (786-795): : 786 - 795
  • [39] AN ALGORITHM FOR COMPUTING THE DISTANCE SPECTRUM OF TRELLIS CODES
    ROUANNE, M
    COSTELLO, DJ
    SCHLEGEL, C
    PROCEEDINGS OF THE 22ND CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1 & 2, 1988, : 544 - 550
  • [40] AN ALGORITHM FOR COMPUTING THE DISTANCE SPECTRUM OF TRELLIS CODES
    ROUANNE, M
    COSTELLO, DJ
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1989, 7 (06) : 929 - 940
12345