On the Feng-Rao Bound for the L-construction of Algebraic Geometry Codes
スポンサーリンク
概要
- 論文の詳細を見る
We show how to apply the Feng-Rao decoding algorithm and the Feng-Rao bound for the Ω-construction of algebraic geometry codes to the L-construction. Then we give examples in which the L-construction gives better linear codes than the Ω-construction in certain range of parameters on the same curve.
- 社団法人電子情報通信学会の論文
- 2000-05-25
著者
-
Miura S
Sony Corporation Information & Network Technologies Laboratories
-
Matsumoto Ryutaroh
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Matsumoto Ryutaroh
Department Of Electrical And Electronic Engineering Tokyo Institute Of Technology
-
Miura Shinji
Sony Corporation Information & Network Technologies Laboratories
関連論文
- Key Rate Available from Mismatched Measurements in the BB84 Protocol and the Uncertainty Principle
- Secret Key Agreement by Soft-Decision of Signals in Gaussian Maurer's Model
- An Improved Bound for the Dimension of Subfield Subcodes
- Decodability of Network Coding with Time-Varying Delay and No Buffering
- Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
- Two Methods for Decreasing the Computational Complexity of the MIMO ML Decoder(Communication Theory)(Information Theory and Its Applications)
- On the Feng-Rao Bound for the L-construction of Algebraic Geometry Codes
- Using C_ Curves in the Function Field Sieve
- Construction Algorithm for Network Error-Correcting Codes Attaining the Singleton Bound(Information Theory and Its Applications)
- Linear Codes on Nonsingular Curves are Better than Those on Singular Curves
- Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight