Kamil Sh. Zigangirov

Francesca Vatta

IEEE Trans. Inf. Theory, 2012

2011

Partially-regular LDPC codes with linear encoding complexity and improved thresholds.

[BibT_eX]

[DOI]

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

2010

Braided convolutional codes: a new class of turbo-like codes.

[BibT_eX]

[DOI]

Wei Zhang

IEEE Trans. Inf. Theory, 2010

Distance bounds for periodically time-varying and tail-biting LDPC convolutional codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Iterative decoding threshold analysis for LDPC convolutional codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

2009

Braided block codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Multi-user OFDM Based on Braided Convolutional Codes.

[BibT_eX]

[DOI]

Proceedings of the Multi-Carrier Systems & Solutions 2009, 2009

2008

Laminated Turbo Codes: A New Class of Block-Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Implementation aspects of LDPC convolutional codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2008

A Low-Cost Serial Decoder Architecture for Low-Density Parity-Check Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. I Regul. Pap., 2008

On the error-correcting capability of LDPC codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2008

Coding Theorems for Repeat Multiple Accumulate Codes

[BibT_eX]

[DOI]

Christian Koller

CoRR, 2008

LDPC convolutional codes based on braided convolutional codes.

[BibT_eX]

[DOI]

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

Asymptotically good LDPC convolutional codes based on protographs.

[BibT_eX]

[DOI]

David G. M. Mitchell

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

Minimum distance bounds for multiple-serially concatenated code ensembles.

[BibT_eX]

[DOI]

Christian Koller

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

Asymptotic distance and convergence analysis of braided protograph convolutional codes.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual Allerton Conference on Communication, 2008

On the minimum trapping distance of repeat accumulate accumulate codes.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual Allerton Conference on Communication, 2008

New multi-user OFDM scheme: Braided code division multiple access.

[BibT_eX]

[DOI]

Proceedings of the 42nd Asilomar Conference on Signals, Systems and Computers, 2008

2007

Distance Bounds for an Ensemble of LDPC Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Tail-Biting LDPC Convolutional Codes Based on Protographs.

[BibT_eX]

[DOI]

Marcos B. S. Tavares

Gerhard P. Fettweis

Proceedings of the 66th IEEE Vehicular Technology Conference, 2007

Tail-Biting LDPC Convolutional Codes.

[BibT_eX]

[DOI]

Marcos B. S. Tavares

Gerhard P. Fettweis

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Joint Permutor Analysis and Design for Multiple Turbo Codes.

[BibT_eX]

[DOI]

C. He

IEEE Trans. Inf. Theory, 2006

A new cycle-based joint permutor design for multiple turbo codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2006

Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2006

On the Erasure Correction Capability of LDPC Codes.

[BibT_eX]

[DOI]

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

Encoders and Decoders for Braided Block Codes.

[BibT_eX]

[DOI]

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

Irregular Low-Density Parity-Check Convolutional Codes Based on Protographs.

[BibT_eX]

[DOI]

Gerd Richter

Markus Kaupper

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

On the Free Distance of Convolutional Turbo Codes.

[BibT_eX]

[DOI]

Axel Hübner

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

Decoders for low-density parity-check convolutional codes with large memory.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2006), 2006

Construction of Irregular LDPC Convolutional Codes with Fast Encoding.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2006

2005

An analysis of the block error probability performance of iterative decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2005

Terminated LDPC convolutional codes with thresholds close to capacity.

[BibT_eX]

[DOI]

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

Laminated turbo codes.

[BibT_eX]

[DOI]

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

Braided convolutional codes.

[BibT_eX]

[DOI]

Wei Zhang

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

2004

Analytic Expressions for the Bit Error Probabilities of Rate-1/2 Memory 2 Convolutional Encoders.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

On permutor designs based on cycles for serially concatenated convolutional codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2004

On the free distance of LDPC convolutional codes.

[BibT_eX]

[DOI]

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

Reduced complexity decoding strategies for LDPC convolutional codes.

[BibT_eX]

[DOI]

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

Turbo codes and Shannon's condition for reliable communication.

[BibT_eX]

[DOI]

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

2003

Asymptotic analysis of superorthogonal turbo codes.

[BibT_eX]

[DOI]

Ola Wintzell

IEEE Trans. Inf. Theory, 2003

2001

On the capacity of a pulse-position-hopped CDMA system.

[BibT_eX]

[DOI]

Ola Wintzell

IEEE Trans. Inf. Theory, 2001

Tighter bounds on the error probability of fixed convolutional codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part II.

[BibT_eX]

[DOI]

Gerd Beyer

IEEE Trans. Inf. Theory, 2001

Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part I.

[BibT_eX]

[DOI]

Gerd Beyer

IEEE Trans. Inf. Theory, 2001

Some Results Concerning the Design and Decoding of Turbo-Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2001

To the Theory of Low-Density Convolutional Codes. II.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2001

New Decoding Error Probability Bounds for Fixed Convolutional Codes used in BSC.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

1999

Active Distances for Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

On coherent reception of uplink transmitted signals in the DS-CDMA system.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Time-varying periodic convolutional codes with low-density parity-check matrix.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

On generalized low-density parity-check codes based on Hamming component codes.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 1999

On the Theory of Low-Density Convolutional Codes.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1999

1998

A Simple One-Sweep Algorithm for Optimal APP Symbol Decoding of Linear Block Codes.

[BibT_eX]

[DOI]

Thomas Johansson

IEEE Trans. Inf. Theory, 1998

On the Calculation of the Error Probability for a Multilevel Modulation Scheme Using QAM-Signaling.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

Analysis of MFSK frequency-hopped spread-spectrum multiple-access over a Rayleigh fading channel.

[BibT_eX]

[DOI]

Leif Wilhelmsson

IEEE Trans. Commun., 1998

1997

On uncoordinated transmission over the T-user q-ary noiseless multiple-access channel.

[BibT_eX]

[DOI]

Leif Wilhelmsson

IEEE Trans. Inf. Theory, 1997

1993

Analysis of Global-List Decoding for Convolutional Codes.

[BibT_eX]

[DOI]

Harro Osthoff

Eur. Trans. Telecommun., 1993

1992

The free distance of fixed convolutional rate 2/4 codes meets the Costello bound.

[BibT_eX]

[DOI]

Vladimir V. Chepyzhov

Ben J. M. Smeets

IEEE Trans. Inf. Theory, 1992

1988

On sequential decoding for the Gilbert channel.

[BibT_eX]

[DOI]

Vladimir Sidorenko

Rolf Johannesson

IEEE Trans. Inf. Theory, 1988

1985

On the distribution of the number of computations in any finite number of subtrees for the stack algorithm.

[BibT_eX]

[DOI]

Rolf Johannesson

IEEE Trans. Inf. Theory, 1985

1984

A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes.

[BibT_eX]

[DOI]

Mats L. Cedervall

Rolf Johannesson

IEEE Trans. Inf. Theory, 1984

1972

On the error probability of sequential decoding on the BSC.

[BibT_eX]

[DOI]