Roxana Smarandache

IEEE J. Sel. Areas Inf. Theory, 2023

A Low Complexity PEG-like Algorithm to Construct Quasi-Cyclic LDPC Codes.

[BibT_eX]

[DOI]

Proceedings of the 12th International Symposium on Topics in Coding, 2023

On the Tanner Cycle Distribution of QC-LDPC Codes from Polynomial Parity-Check Matrices.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

A Unifying Framework to Construct QC-LDPC Tanner Graphs of Desired Girth.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Using Minors to Construct Generator Matrices for Quasi-Cyclic LDPC Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Necessary and Sufficient Girth Conditions for LDPC Tanner Graphs with Denser Protographs.

[BibT_eX]

[DOI]

Proceedings of the 11th International Symposium on Topics in Coding, 2021

Necessary and Sufficient Girth Conditions for Tanner Graphs of Quasi-Cyclic LDPC Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Designing Protograph-Based Quasi-Cyclic Spatially Coupled LDPC Codes With Large Girth.

[BibT_eX]

[DOI]

Shiyuan Mo

Li Chen

Jie Qiu

IEEE Trans. Commun., 2020

2018

Free Pseudodistance Growth Rates for Spatially Coupled LDPC Codes over the BEC.

[BibT_eX]

[DOI]

Cunlu Zhou

Proceedings of the IEEE Information Theory Workshop, 2018

2017

A frotograph-based design of quasi-cyclic spatially coupled LDPC codes.

[BibT_eX]

[DOI]

Li Chen

Shiyuan Mo

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Constructing strongly-MDS convolutional codes with maximum distance profile.

[BibT_eX]

[DOI]

Diego Napp

Adv. Math. Commun., 2016

2015

Bounding the Bethe and the Degree-M Bethe Permanents.

[BibT_eX]

[DOI]

Martin Haenggi

CoRR, 2015

Bethe and M-Bethe Permanent Inequalities.

[BibT_eX]

[DOI]

Martin Haenggi

Proceedings of the 2015 IEEE Global Communications Conference, 2015

2014

Quasi-Cyclic LDPC Codes Based on Pre-Lifted Protographs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Spatially coupled sparse codes on graphs: theory and practice.

[BibT_eX]

[DOI]

IEEE Commun. Mag., 2014

2013

Diversity Polynomials for the Analysis of Temporal Correlations in Wireless Networks.

[BibT_eX]

[DOI]

Martin Haenggi

IEEE Trans. Wirel. Commun., 2013

Pseudocodewords from Bethe permanents.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Decoding of Convolutional Codes Over the Erasure Channel.

[BibT_eX]

[DOI]

Virtudes Tomás

IEEE Trans. Inf. Theory, 2012

Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

LDPC Codes for Compressed Sensing.

[BibT_eX]

[DOI]

Alexandros G. Dimakis

IEEE Trans. Inf. Theory, 2012

Constructing good QC-LDPC codes by pre-lifting protographs.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

2011

Deriving Good LDPC Convolutional Codes from LDPC Block Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Partially Quasi-Cyclic Protograph-Based LDPC Codes.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2011

2010

Quasi-cyclic asymptotically regular LDPC codes.

[BibT_eX]

[DOI]

Michael Lentmaier

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

On minimal pseudo-codewords.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Pseudocodeword performance analysis for LDPC convolutional codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Decoding of MDP convolutional codes over the erasure channel.

[BibT_eX]

[DOI]

Virtudes Tomás

Proceedings of the IEEE International Symposium on Information Theory, 2009

Absdet-pseudo-codewords and perm-pseudo-codewords: Definitions and properties.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Spectral Graph Analysis of Quasi-Cyclic Codes.

[BibT_eX]

[DOI]

Mark F. Flanagan

Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

2007

Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

On Deriving Good LDPC Convolutional Codes from QC LDPC Block Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Strongly-MDS convolutional codes.

[BibT_eX]

[DOI]

Heide Gluesing-Luerssen

IEEE Trans. Inf. Theory, 2006

Pseudo-Codeword Performance Analysis for LDPC Convolutional Codes

[BibT_eX]

[DOI]

CoRR, 2006

Superregular Matrices and the Construction of Convolutional Codes having a Maximum Distance Profile

[BibT_eX]

[DOI]

Ryan Hutchinson

Jochen Trumpf

CoRR, 2006

Pseudo-Codewords in LDPC Convolutional Codes.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Convolutional codes with maximum distance profile.

[BibT_eX]

[DOI]

Ryan Hutchinson

Syst. Control. Lett., 2005

Bounds on the Pseudo-Weight of Minimal Pseudo-Codewords of Projective Geometry Codes

[BibT_eX]

[DOI]

Marcel Wauer

CoRR, 2005

On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes

[BibT_eX]

[DOI]

CoRR, 2005

On the minimal pseudo-codewords of codes from finite geometries.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

On regular quasicyclic LDPC codes from binomials.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Construction of good LDPC codes using dilation matrices.

[BibT_eX]

[DOI]

Marcus Greferath

Michael E. O'Sullivan

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2001

Constructions of MDS-convolutional codes.

[BibT_eX]

[DOI]

Heide Gluesing-Luerssen

IEEE Trans. Inf. Theory, 2001

1999

Maximum Distance Separable Convolutional Codes.

[BibT_eX]

[DOI]