A Note on a Lower Bound for Generalized Hamming Weights
スポンサーリンク
概要
- 論文の詳細を見る
A lower bound for the generalized Ramming weight of linear codes is proposed. The proposed bound is a generalization of the bound we previously presented and gives good estimate for generalized Hamming weight of Reed-Muller, some one point algebraic geometry, and arbitrary cyclic codes. Moreover the proposed bound contains the BCH bound as its special case. The relation between the proposed bound and conventional bounds is also investigated.
- 一般社団法人電子情報通信学会の論文
- 2001-12-01
著者
-
Sakaniwa Kohichi
The Deoartament Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Shibuya Tomoharu
The Department Of Communication And Integrated Systems Graduate School Of Science And Engineering To
-
Sakaniwa Kohichi
The Department Of Communication And Integrated Systems Tokyo Institute Of Technology
-
Shibuya Tomoharu
The Department Of Communication And Integrated Systems Tokyo Institute Of Technology
関連論文
- A Design of Near Perfect Reconstruction Linear-Phase QMF Banks Based on Hybrid Steepest Descent Method(Special Section on Digital Signal Processing)
- Extended Symbol-Aided Estimation for Non-selective Rayleigh Fading Channels
- An Analysis of a 16QAM System Using Extended Symbol-Aided Estimation under Rician Fading Channels
- Fast Acquisition of PN Sequences in DS/CDMA Systems(Regular Section)
- Simple Estimation for the Dimension of Subfield Subcodes of AG Codes
- A Simple Nonlinear Pre-Filtering for a Set-Theoretic Linear Blind Deconvolution Scheme(Special Section on Digital Signal Processing)
- Detailedly Represented Irregular Low-Density Parity-Check Codes(Coding Theory)(Information Theory and Its Applications)
- A Fast Blind Multiple Access Interference Reduction in DS/CDMA Systems Based on Adaptive Projected Subgradient Method(Signal Processing for Communications)(Digital Signal Processing)
- On Tanner's Lower Bound for the Minimum Distance of Regular LDPC Codes Based on Combinatorial Designs(Coding Theory)(Information Theory and Its Applications)
- A Dual of Well-Behaving Type Designed Minimum Distance
- Performance of a Decoding Algorithm for LDPC Codes Based on the Concave-Convex Procedure(Cording Theory)(Information Theory and Its Applications)
- Fast Encoding of Algebraic Geometry Codes(Special Section on Information Theory and Its Applications)
- A Fast Neural Network Learning with Guaranteed Convergence to Zero System Error (Special Section on Information Theory and Its Applications)
- A Note on a Lower Bound for Generalized Hamming Weights
- Simple Nonbinary Coding Strategy for Very Noisy Relay Channels
- Analysis of Error Floors for Non-binary LDPC Codes over General Linear Group through q-Ary Memoryless Symmetric Channels