On Optimal and Proper Binary Codes from Irreducible Cyclic Codes over GF(2^m) (Special Section on Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
We prove that binary images of irreducible cyclic codes C over GF(2^m) and binary concatenated codes of C and a binary [m + 1,m,2] even-parity code are optimal (in the sense that they meet the Griesmer bound with equality) and proper, if a root of the check polynomial of C is primitive over GF(2^m) or its extensions.
- 社団法人電子情報通信学会の論文
- 1999-10-25
著者
-
Sakakibara Katsumi
Faculty Of Computer Science And System Engineering Okayama Prefectural University
-
Sakakibara Katsumi
Faculty Of Computer Science & System Engineering Okayama Prefectural University
-
YUBA Yoshiharu
Faculty of Computer Science & System Engineering, Okayama Prefectural University
-
Yuba Yoshiharu
Faculty Of Computer Science And System Engineering Okayama Prefectural University
-
IWASA Ritsuko
Faculty of Computer Science and System Engineering, Okayama Prefectural University
-
Iwasa Ritsuko
Faculty Of Computer Science And System Engineering Okayama Prefectural University
関連論文
- Analysis of Unsaturation Performance of IEEE 802.11 DCF with and without Slow Contention Window Decrease(Communication Theory, Information Theory and Its Applications)
- Combinatorial Effects of Timer Control and Backoff Algorithms on Bulk Data Transfer over Two-State Markovian Channels(Fundamental Theories)
- Combinatorial Effects of Timer Control and Backoff Algorithms on Bulk Data Transfer over Two-State Markovian Channels
- On the Stability of Five Types of Slotted ALOHA Systems with Capture and Multiple Packet Reception (Special Section on Information Theory and Its Applications)
- Performance Comparison of Two Retransmission Control Schemes for Slow-Frequency-Hopped Communication Systems (Special Section on Spread Spectrum Techniques and Applications)
- On the Unequal Error Protection Capability of a q-Ary Image 0f a L0W-Rate q^m-Ary Cyclic Code (Special Section on Information Theory and Its Applications)
- On Optimal and Proper Binary Codes from Irreducible Cyclic Codes over GF(2^m) (Special Section on Information Theory and Its Applications)