On the Performance of Algebraic Geometric Codes

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, we show that the conventional BCH codes can be better than the AG codes when the number of check symbols is relatively small. More precisely, we consider an AG code on C_<ab> whose number of check symbols is less than min{g+a,n-g}, where n and g denote the code length and the genus of the curve, respectively. It is shown that there always exists an extended BCH code, (i) which has the same designed distance as the Feng-Rao designed distance of the AG code and the code length and the rate greater than those of the AG code, or (ii) which has the same number of check symbols as that of the AG code, the designed distance not less than that of the AG code and the code length longer than that of the AG code.

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

著者

• Sakaniwa Kohichi

  Department Of Communications And Integrated Systems Graduate School Of Science And Engineering Tokyo

• Sakaniwa Kohichi

  Department Of Electrical And Electronic Engineering Tokyo Institute Of Technology

• Shibuya Tomoharu

  Department of Information and Communication Sciences, Sophia University

• Sakaniwa Kohichi

  Departmen Of Communications And Integrated Systems Tokyo Institute Of Technology

• JINUSHI Hajime

  Department of Electronic Engineering and Electronics, Aoyama Gakuin University

• MIURA Shinji

  NEC C&C lab.

• Shibuya Tomoharu

  Department Of Communications And Integrated Systems Tokyo Institute Of Technology

• Shibuya Tomoharu

  Department Of Electrical And Electronic Engineering Tokyo Institute Of Technology

• Jinushi Hajime

  Department Of Electronic Engineering And Electronics Aoyama Gakuin University

• Miura Shinji

  Nec C&c Lab.

関連論文

• A Higher Order Generalization of an Alias-Free Discrete Time-Frequency Analysis(Special Section on Digital Signal Processing)
• A Note on Constrained Least Squares Design of M-D FIR Filter Based on Convex Projection Techniques(Special Section on Digital Signal Processing)
• CONSTRAINED LEAST SQUARES DESIGN OF M-D FIR FILTER BASED ON CONVEX PROJECTION TECHNIQUES
• A-6-2 Modified Cancellation for Non-Binary LDPC Codes
• Encoding of Linear Codes Based on the Rearrangement of Block-Triangularized Parity-Check Matrices
• On Generalized Hamming Weights of Codes Constructed on Affine Algebraic Varieties (Special Section on Information Theory and Its Applications)
• On the Comparison of Lower Bounds for Generalized Hamming Weights
• Fast Acquisition of PN Sequences in DS-CDMA Systems with Incoherent Demodulator(Wireless Communication Technologies)
• Fast Acquisition of PN Sequences in DS/CDMA Systems(Regular Section)
• An Associative Memory Neural Network to Recall Nearest Pattern from Input
• Simple Estimation for the Dimension of Subfield Subcodes of AG Codes
• An Improved Bound for the Dimension of Subfield Subcodes
• A Simple Nonlinear Pre-Filtering for a Set-Theoretic Linear Blind Deconvolution Scheme(Special Section on Digital Signal Processing)
• A Set-Theoretic Blind Image Deconvolution Based on Hybrid Steepest Descent Method (Special Section on Digital Signal Processing)
• Multi-edge type LDPC code ensembles with exponentially few codewords of linear small weight (情報理論)
• A note on analytical solution of covariance evolution for regular LDPC codes (情報理論)
• Performance Analysis of LDPC Code Ensembles with Support Weight Distribution
• A-6-1 Design of Irregular LDPC Codes with Uniform Check Node Degree Distributions
• Design of IRA codes with Joint Degree Distributions
• Iterative Decoding Based on the Concave-Convex Procedure(Coding Theory)
• Justesen-Type Modified Expander Codes and Their Decoding Algorithm(Coding Theory, Information Theory and Its Applications)
• On the Performance of Algebraic Geometric Codes
• A Note on Robust Adaptive Volterra Filtering Based on Parallel Subgradient Projection Techniques(Digital Signal Processing)
• A Lower Bound for Generalized Hamming Weights and a Condition for t-th Rank MDS
• Some Classes of Quasi-Cyclic LDPC Codes : Properties and Efficient Encoding Method(Coding Theory)
• On the size of circulant matrices for which reversible codes exist (ワイドバンドシステム)
• Construction of Cyclic Codes Suitable for Iterative Decoding via Generating Idempotents
• Characterization of Factor Graph by Mooij's Sufficient Condition for Convergence of the Sum-Product Algorithm
• Improvement of Extended Symbol-Aided Estimation for Rayleigh Fading Channels (Special Section on Information Theory and Its Applications)
• Sufficient conditions for convergence of the sum-product decoding (情報理論)
• On the size of circulant matrices for which reversible codes exist (情報処理)
• Sufficient conditions for convergence of the sum-product decoding (情報セキュリティ)
• On the size of circulant matrices for which reversible codes exist (情報セキュリティ)
• Sufficient conditions for convergence of the sum-product decoding (ワイドバンドシステム)
• Rate-Compatible Non-Binary LDPC Codes for Rate Adaptive Systems
• Analysis of Stopping Constellation Distribution for Irregular Non-binary LDPC Code Ensemble
• Ring Theoretic Approach to Reversible Codes Based on Circulant Matrices
• Design and Performance of Rate-Compatible Non-binary LDPC Convolutional Codes
• Spatially Coupled Protograph-Based LDPC Codes for Decode-and-Forward in Erasure Relay Channel
• On the dependence of error performance of spatially coupled LDPC codes on their design parameters
• On the Dependence of Error Performance of Spatially Coupled LDPC Codes on Their Design Parameters

もっと見る 閉じる

スポンサーリンク