Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEICE Technical Report; IEICE Tech. Rep.

Improvement of the Method for Computing the Weight Spectrum of LDPC Convolutional Codes

Masanori Hirotomo, Masakatu Morii

Published Sep 22, 2011• 1 citation
OpenAlex

Related papers

On Computing the Weight Spectrum of LDPC Convolutional Codes Constructed from Quasi-Cyclic Codes

Masanori Hirotomo, Masakatu Morii

IEICE Technical Report; IEICE Tech. Rep.•Sep 20, 2012•0 citations

On Computing the Weight Distribution of LDPC Convolutional Codes

Masanori Hirotomo, Masakatu Morii

IEICE Technical Report; IEICE Tech. Rep.•Sep 14, 2010•0 citations

A Method for Computing the Weight Spectrum of LDPC Convolutional Codes Based on Circulant Matrices

Masanori Hirotomo, Masakatu Morii

In this paper, we propose an efficient method for computing the weight spectrum of LDPC convolutional codes based on circulant matrices of quasi-cyclic codes. In the proposed method, we reduce the memory size of their parity-check matrices with the same distance profile as the original codes, and apply a forward and backward tree search algorithm to the parity-check matrices of reduced memory. We show numerical results of computing the free distance and the low-part weight spectrum of LDPC convolutional codes of memory about 130.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2014•0 citations

An efficient method for computing the weight spectrum of LDPC convolutional codes constructed from quasi-cyclic codes

Masanori Hirotomo, Masakatu Morii

In this paper, we propose an efficient method for computing the weight spectrum of LDPC convolutional codes constructed from quasi-cyclic block codes. In the proposed method, we reduce the memory size of their parity-check matrices with the same distance profile as original codes, and apply a forward and backward tree search algorithm to the parity-check matrices of reduced memory. We show numerical results of computing the minimum free distance and the low-part weight spectrum of LDPC convolutional codes of memory about 130.

International Symposium on Information Theory and its Applications•Oct 1, 2012•1 citation

A Probabilistic Method for Computing the Weight Distribution of LDPC Codes

Masanori Hirotomo, Masami Mohri, Masakatu Morii

IEICE Technical Report; IEICE Tech. Rep.•Sep 9, 2004•0 citations

Construction of time-invariant LDPC convolutional codes with modified method

Liwei Mu, Xingcheng Liu

Acta Scientiarum Naturalium Universitatis Sunyatseni•Jan 25, 2016•0 citations
In this paper, we propose an efficient method for computing the weight spectrum of LDPC convolutional codes based on circulant matrices of quasi-cyclic codes. In the proposed method, we reduce the memory size of their parity-check matrices with the same distance profile as the original codes, and apply a forward and backward tree search algorithm to the parity-check matrices of reduced memory. We show numerical results of computing the free distance and the low-part weight spectrum of LDPC convolutional codes of memory about 130.
In this paper, we propose an efficient method for computing the weight spectrum of LDPC convolutional codes constructed from quasi-cyclic block codes. In the proposed method, we reduce the memory size of their parity-check matrices with the same distance profile as original codes, and apply a forward and backward tree search algorithm to the parity-check matrices of reduced memory. We show numerical results of computing the minimum free distance and the low-part weight spectrum of LDPC convolutional codes of memory about 130.