Some Optimal and Quasi-Optimal Binary Codes from Cyclic Codes over GF (2^m)
スポンサーリンク
概要
- 論文の詳細を見る
It is shown that five optimal and one quasi-optimal binary codes with respect to the Griesmer bound can be obtained from cyclic codes over GF(2^m). An [m(2^<em - 1>),em, 2^<em-1>m] code, a [3(2^<2e> -1), 2e, 3・2^<2e-1>] code, a [2(2^<2e-1>),2, (2^<2e+2>-4)/3] code,a [3(2^<2e>-1), 2, 2^<2e+1>- 2] code, and a [3(2^<2e>-1),3・2(e+1,),3・2^<2e-1>-2] code are optimal and a [2(2^<2e-1>),2(e + 1), 2^<2e> - 2] code is quasi-optimal.
- 社団法人電子情報通信学会の論文
- 1996-10-25
著者
-
SAKAKIBARA Katsumi
Faculty of Computer Science and System Engineering, Okayama Prefectural University
-
Sakakibara Katsumi
The Faculty Of Computer Science & System Engineering Okayama Prefectural University
-
Sakakibara Katsumi
Department Of Obstetrics And Gyleecology Nagoya University School Of Medicine
-
Kasahara Masao
Osaka Gakuin Univ. Suita‐shi Jpn
-
KASAHARA Masao
the Faculty of Engineering and Design, Kyoto Institute of Technology
-
YUBA Yoshiharu
the Faculty of Computer Science & System Engineering, Okayama Prefectural University
-
Kasahara Masao
The Faculty Of Engineering And Design Kyoto Institute Of Technology
-
Yuba Y
Okayama Prefectural Univ. Soja‐shi Jpn
-
Kasahara Masao
Department of Faculty of Informatics, Osaka Gakuin University
関連論文
- Analysis of Unsaturation Performance of IEEE 802.11 DCF with and without Slow Contention Window Decrease(Communication Theory, Information Theory and Its Applications)
- On the Stability of Slow-Frequency-Hopped Slotted ALOHA Systems with Retransmission Cutoff(Special Section on 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
- Notes on the Average Binary Weight Enumerator of Generalized Algebraic-Geometric Codes (Special Section on Information Theory and Its Applications)
- A New Product-Sum Type Public Key Cryptosystem Based on Reduced Bases : Special Section on Cryptography and Information Security
- A New Probabilistic ID-Based Non-interactive Key Sharing Scheme(Special Section on Cryptography and Information Security)
- An Upper Bound on Frame Error Rate for Generalized Concatenated Convolutional Codes
- A Method for Evaluating Minimum Free Chernov Distance of Trellis-Codes for Discrete Memoryless Channel (Special Section on Information Theory and Its Applications)
- An Upper Bound on Bit Error Rate for Concatenated Convolutional Code
- A Class of Trellis-Codes for Partial Response Channel
- Matched Design Method for Concatenated Trellis-Coded Modulation
- High Rate Binary Coset Code Used for Inner Code
- Multi-Dimensional Block Shaping
- An 8-Dimensional Trellis-Coded 8-PSK with Non-zero Crossing Constraint (Special Section on Information Theory and Its Applications)
- 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 of Type-I Hybrid Selective-Repeat ARQ with Finite Buffer on Fading Channels (Special Issue on Advances in Satellite Communications toward Multimedia Era)
- New Product-Sum Type Public-Key Cryptosystems with Selectable Encryption Key Based on Chinese Remainder Theorem
- A New Product-Sum Public-Key Cryptosystem Using Message Extension(Special Section on Information Theory and Its Applications)
- Some Optimal and Quasi-Optimal Binary Codes from Cyclic Codes over GF (2^m)
- 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)
- PROGNOSTIC SIGNIFICANCE OF NUCLEAR ANALYSIS IN INVASIVE CARCINOMA OF CERVIX PATIENTS TREATED BY PRIMARY RADIATION