Modified error correction/detection decoding scheme of binary hamming codes

被引：0
|
作者：
The Hong Kong Polytechnic Univ, Kowloon, Hong Kong [1 ]
机构：
来源：
IEICE Trans Fund Electron Commun Comput Sci | / 4卷 / 786-788期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] ADMM decoding of error correction codes: from geometries to algorithms
    Liu, Xishuo
    Draper, Stark C.
    2015 IEEE INFORMATION THEORY WORKSHOP (ITW), 2015,
  • [42] OPTIMAL MODIFIED HAMMING CODES
    AZUMI, S
    KASAMI, T
    ELECTRONICS & COMMUNICATIONS IN JAPAN, 1975, 58 (06): : 9 - 15
  • [43] Effectiveness of Hamming Single Error Correction Codes under Harsh Electromagnetic Disturbances
    Van Waes, Jonas
    Lannoo, Jonas
    Vankeirsbilck, Jens
    Degraeve, Andy
    Peuteman, Joan
    Vanoost, Dries
    Pissoort, Davy
    Boydens, Jeroen
    2018 INTERNATIONAL SYMPOSIUM ON ELECTROMAGNETIC COMPATIBILITY (EMC EUROPE), 2018, : 271 - 276
  • [44] THE HAMMING BOUND FOR BINARY ARITHMETIC AN CODES
    ERNVALL, S
    ARS COMBINATORIA, 1985, 20B : 207 - 227
  • [45] On a recursive structure of binary hamming codes
    Loskot, P
    Beaulieu, NC
    CONFERENCE RECORD OF THE THIRTY-EIGHTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, VOLS 1 AND 2, 2004, : 1136 - 1140
  • [46] On identifying codes in binary Hamming spaces
    Honkala, I
    Lobstein, A
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2002, 99 (02) : 232 - 243
  • [47] On the average Hamming distance for binary codes
    Xia, ST
    Fu, FW
    DISCRETE APPLIED MATHEMATICS, 1998, 89 (1-3) : 269 - 276
  • [48] Binary Hamming codes and Boolean designs
    Giovanni Falcone
    Marco Pavone
    Designs, Codes and Cryptography, 2021, 89 : 1261 - 1277
  • [49] Error-correction capability of binary linear codes
    Helleseth, T
    Klove, T
    Levenshtein, VI
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (04) : 1408 - 1423
  • [50] Error-correction capability of binary linear codes
    Helleseth, T
    Klove, T
    Levenshtein, VI
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 463 - 463
12345