Compound-Error-Correcting Codes and Their Augmentation(Coding Theory)
スポンサーリンク
概要
- 論文の詳細を見る
A compound error is any combination of burst errors with various burst lengths including random errors. The compound weight of any such error is defined as a kind of combinational metric which is a generalization of Gabidulin's metric. First, we present a fast method for calculating the weight of any word. Based on this method, as an extension of Wadayama's augmenting method in the case of Hamming weight, we propose a method of constructing codes having higher coding rate by augmenting any compound-error-correcting codes. Furthermore, we show some examples of good compound-error-correcting codes obtained by using our augmenting method.
- 社団法人電子情報通信学会の論文
- 2003-07-01
著者
-
Sakata Shojiro
Department Of Computer Science And Information Mathematics The University Of Electro-communications
-
Sakata Shojiro
Department Of Information And Communication Engineering University Of Electro-communications
-
Fujisawa Masaya
Department Of Industrial Management & Engineering Tokyo University Of Science
-
MAEDA Shusuke
Department of Information and Communication Engineering, University of Electro-Communications
-
Maeda S
Department Of Information And Communication Engineering University Of Electro-communications
関連論文
- On a Class of Byte-Error-Correcting Codes from Algebraic Curves and Their Fast Decoding Algorithm (Special Section on information Theory and Its Applications)
- Determination of Unknown Syndromes in Parallel Decoding of Codes from Algebraic Curves with Systolic Array
- With a higher probability one can correct errors up to half the designed distance for primal codes from curves
- Compound-Error-Correcting Codes and Their Augmentation(Coding Theory)
- A Construction of High Rate Quasi-Cyclic Regular LDPC Codes from Cyclic Difference Families with Girth 8(Coding Theory)