Justesen-Type Modified Expander Codes and Their Decoding Algorithm(Coding Theory, <Special Section>Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
In 1996, Sipser and Spielman [12] constructed a family of linear-time decodable asymptotically good codes called expander codes. Recently, Barg and Zemor [2] gave a modified construction of expander codes, which greatly improves the code parameters. In this paper we present a new simple algebraic decoding algorithm for the modified expander codes of Barg and Zemor, and give a Justesen-type construction of linear-time decodable asymptotically good binary linear codes that meet the Zyablov bound.
- 社団法人電子情報通信学会の論文
- 2005-10-01
著者
-
Sakaniwa Kohichi
Department Of Communications And Integrated Systems Graduate School Of Science And Engineering Tokyo
-
Sakaniwa Kohichi
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Sakaniwa Kohichi
Departmen Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Sakaniwa Kohichi
Tokyo Inst. Technol. Tokyo Jpn
-
FUJITA Hachiro
Department of Communications and Integrated Systems, Tokyo Institute of Technology
-
Fujita Hachiro
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
関連論文
- 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
- 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)
- Construction of Cyclic Codes Suitable for Iterative Decoding via Generating Idempotents
- Improvement of Extended Symbol-Aided Estimation for Rayleigh Fading Channels (Special Section on Information Theory and Its Applications)
- Rate-Compatible Non-Binary LDPC Codes for Rate Adaptive Systems
- Analysis of Stopping Constellation Distribution for Irregular Non-binary LDPC Code Ensemble
- 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