CLASS OF MAJORITY-LOGIC-DECODABLE CODES WITH A MINIMUM DISTANCE OF 4

被引:2
|
作者
SHIVA, SGS [1 ]
机构
[1] UNIV OTTAWA,DEPT ELECT ENGN,OTTAWA K1N 6N5,ONTARIO,CANADA
关键词
D O I
10.1049/el:19760456
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
引用
收藏
页码:599 / 600
页数:2
相关论文
共 50 条
  • [31] A class of constituent codes with minimum distance 8
    [J]. 2001, Nauka Moscow (37):
  • [33] A Class of Composite Codes with Minimum Distance 8
    I. M. Boyarinov
    I. Martin
    B. Honary
    [J]. Problems of Information Transmission, 2001, 37 (4) : 353 - 364
  • [34] The Bose and Minimum Distance of a Class of BCH Codes
    Ding, Cunsheng
    Du, Xiaoni
    Zhou, Zhengchun
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (05) : 2351 - 2356
  • [35] One-Step Majority-Logic Decodable Codes derived from Oval Designs
    El Mouaatamid, Otmane
    Lahmer, Mohamed
    Belkasmi, Mostafa
    M'Rabet, Zakaria
    Yatribi, Anouar
    [J]. 2017 INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS AND MOBILE COMMUNICATIONS (WINCOM), 2017, : 244 - 249
  • [36] Locally Decodable Codes for Edit Distance
    Ostrovsky, Rafail
    Paskin-Cherniavsky, Anat
    [J]. INFORMATION THEORETIC SECURITY (ICITS 2015), 2015, 9063 : 236 - 249
  • [37] Iterative majority logic decoding of a class of Euclidean Geometry codes
    Thangaraj, A
    McLaughlin, SW
    [J]. ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 365 - 365
  • [38] Iterative Decoding of L-step Majority-Logic Decodable Codes Based on Belief Propagation
    Ding, Suquan
    [J]. 2007 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-15, 2007, : 819 - 821
  • [39] Construction of Cyclic One-Step Majority-Logic Decodable Codes using Genetic Algorithms
    Yatribi, Anouar
    Ayoub, Fouad
    Belkasmi, Mostafa
    [J]. 2015 INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS AND MOBILE COMMUNICATIONS (WINCOM), 2015, : 17 - 22
  • [40] A class of Sudan-decodable codes
    Nielsen, RR
    [J]. 2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 112 - 112