Metrics of Error Locating Codes

スポンサーリンク

概要

• 論文の詳細を見る

• Error locating codes were first presented in 1963 by J.K. Wolf and B. Elspas. Since then several code design methods have been proposed. However, their algebraic structure has not yet been clarified. It is apparent that necessary and sufficient conditions for error correcting/detecting codes can be expressed by Hamming distance, but, on the other hand, those for error locating codes cannot always be expressed only by Hamming distance. This paper presents necessary and sufficient conditions for error locating codes by using a newly defined metric and a function. The function represents the number of bytes where Hamming distance between corresponding bytes of two codewords has a certain integer range. These conditions show that an error locating code having special code parameters is an error correcting/detecting code. This concludes that error locating codes include existing bit/byte error correcting/detecting codes in their special cases.

• 社団法人電子情報通信学会の論文
• 1997-11-25

著者

• Kitakami Masato

  The Faculty Of Engineering Chiba University

• Kitakami Masato

  The Faculty Of Engineering Tokyo Institute Of Technology

• FUJIWARA Eiji

  the Graduate School of Information Science and Engineering, Tokyo Institute of Technology

• JIANG Shuxin

  the Graduate School of Information Science and Engineering, Tokyo Institute of Technology

• Jiang S

  Yokohama National Univ. Yokohama‐shi Jpn

• Fujiwara Eiji

  The Graduate School Of Information Science And Engineering Tokyo Institute Of Technology

関連論文

• Random Double Bit Error Correcting : Single b-bit Byte Error Correcting(DEC-S_bEC)Codes for Memory Systems
• Burst Error Recovery for VF Arithmetic Coding
• Systematic Binary Deletion/Insertion Error Correcting Codes Capable of Correcting Random Bit Errors
• Metrics of Error Locating Codes

スポンサーリンク