Rolf Johannesson

IEEE Trans. Inf. Theory, 2016

2014

A unified approach to optimization of LDPC codes for various communication scenarios.

[BibT_eX]

[DOI]

Proceedings of the 8th International Symposium on Turbo Codes and Iterative Information Processing, 2014

LDPC convolutional codes versus QC LDPC block codes in communication standard scenarios.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Near maximum-likelihood decoding of Generalized LDPC and woven graph codes.

[BibT_eX]

[DOI]

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

Combinatorial optimization for improving QC LDPC codes performance.

[BibT_eX]

[DOI]

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

2012

Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

A Closed-Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Dual convolutional codes and the MacWilliams identities.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2012

High-rate QC LDPC codes of short and moderate length with good girth profile.

[BibT_eX]

[DOI]

Proceedings of the 7th International Symposium on Turbo Codes and Iterative Information Processing, 2012

A greedy search for improved QC LDPC codes with good girth profile and degree distribution.

[BibT_eX]

[DOI]

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

2011

Woven convolutional graph codes with large free distances.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2011

An Analytic Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes

[BibT_eX]

[DOI]

CoRR, 2011

On the exact bit error probability for Viterbi decoding of convolutional codes.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2011

Some voltage graph-based LDPC tailbiting codes with large girth.

[BibT_eX]

[DOI]

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

Double-Hamming based QC LDPC codes with large minimum distance.

[BibT_eX]

[DOI]

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

2010

A rate R = 5/20 hypergraph-based woven convolutional code with free distance 120.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Woven graph codes: asymptotic performances and examples.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

On weight enumerators and MacWilliams identity for convolutional codes.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2010

New low-density parity-check codes with large girth based on hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Low-complexity error correction of Hamming-code-based LDPC codes.

[BibT_eX]

[DOI]

Maja Loncar

Probl. Inf. Transm., 2009

Searching for high-rate convolutional codes via binary syndrome trellises.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Soft-Output BEAST Decoding With Application to Product Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Asymptotic performances of woven graph codes.

[BibT_eX]

[DOI]

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

2007

Trellis Complexity of Short Linear Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

A Comparison of Some Trellis- and Tree-Based SISO Algorithms for Decoding and Equalization.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Asymptotically Good Woven Codes with Fixed Constituent Convolutional Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Unequal error protection for convolutional codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

On Suboptimum Component Decoding for Product Codes.

[BibT_eX]

[DOI]

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

An Improved Bound on the List Error Probability and List Distance Properties.

[BibT_eX]

[DOI]

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

2005

BEAST decoding of block codes obtained via convolutional codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

BEAST decoding - asymptotic complexity.

[BibT_eX]

[DOI]

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Unequal error protection explained by state-transition graphs.

[BibT_eX]

[DOI]

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

Estimating the list size for BEAST-APP decoding.

[BibT_eX]

[DOI]

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

2004

On nested convolutional codes and their application to woven codes.

[BibT_eX]

[DOI]

Ralph Jordan

Martin Bossert

IEEE Trans. Inf. Theory, 2004

Woven convolutional codes. II: decoding aspects.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

On Error Exponents for Woven Convolutional Codes With One Tailbiting Component Code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Low State Complexity Block Codes Via Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

A BEAST for Prowling in Trees.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Detecting and Correcting Capabilities of Convolutional Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2004

BEAST decoding for block codes.

[BibT_eX]

[DOI]

Eur. Trans. Telecommun., 2004

On unequal error protection for information symbols via active distances.

[BibT_eX]

[DOI]

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

A new look at the error-correcting capabilities of convolutional codes.

[BibT_eX]

[DOI]

Sabine Ertl

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

On APP-decoding using BEAST.

[BibT_eX]

[DOI]

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

2003

Boosting the error performance of suboptimal tailbiting decoders.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2003

2002

A note on tailbiting codes and their feedback encoders.

[BibT_eX]

[DOI]

John B. Anderson

IEEE Trans. Inf. Theory, 2002

Woven convolutional codes I: Encoder properties.

[BibT_eX]

[DOI]

Stefan Höst

IEEE Trans. Inf. Theory, 2002

Tailbiting codes: Bounds and search results.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Tailbiting codes obtained via convolutional codes with large active distance-slopes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

A Note on Systematic Tailbiting Encoders.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2002

Distance Approach to Window Decoding.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2002

Encoder and Distance Properties of Woven Convolutional Codes with One Tailbiting Component Code.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2002

A Distance Measure Tailored to Tailbiting Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2002

2001

On the error exponent for woven convolutional codes with inner warp.

[BibT_eX]

[DOI]

Sergo Shavgulidze

IEEE Trans. Inf. Theory, 2001

2000

A note on type II convolutional codes.

[BibT_eX]

[DOI]

Emma Wittenmark

IEEE Trans. Inf. Theory, 2000

1999

On the error exponent for woven convolutional codes with outer warp.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Optimal and near-optimal encoders for short and moderate-length tail-biting trellises.

[BibT_eX]

[DOI]

John B. Anderson

IEEE Trans. Inf. Theory, 1999

New rate 1/2, 1/3, and 1/4 binary convolutional encoders with an optimum distance profile.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Active Distances for Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

1998

Systematic Feed-Forward Convolutional Encoders Are Better than Other Encoders with an M-Algorithm Decoder.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

Some Structural Properties of Convolutional Codes over Rings.

[BibT_eX]

[DOI]

Zhe-xian Wan

Emma Wittenmark

IEEE Trans. Inf. Theory, 1998

Two 16-State, Rate R = 2/4 Trellis Codes Whose Free Distances Meet the Heller Bound.

[BibT_eX]

[DOI]

Emma Wittenmark

IEEE Trans. Inf. Theory, 1998

1996

Minimal and canonical rational generator matrices for convolutional codes.

[BibT_eX]

[DOI]

G. David Forney Jr.

Zhe-xian Wan

IEEE Trans. Inf. Theory, 1996

1995

Review of 'Algebraic Methods for Signal Processing and Communications Coding' (Blahut, R.E.; 1991).

[BibT_eX]

IEEE Trans. Inf. Theory, 1995

1993

A linear algebra approach to minimal convolutional encoders.

[BibT_eX]

[DOI]

Zhe-xian Wan

IEEE Trans. Inf. Theory, 1993

1992

Informationstheorie - Grundlage der (Tele-)Kommunikation.

[BibT_eX]

Addison-Wesley, ISBN: 978-3-89319-465-0, 1992

1991

Strengthening Simmons' bound on impersonation.

[BibT_eX]

[DOI]

Andrea Sgarro

IEEE Trans. Inf. Theory, 1991

1989

A fast algorithm for computing distance spectrum of convolutional codes.

[BibT_eX]

[DOI]

Mats L. Cedervall

IEEE Trans. Inf. Theory, 1989

1988

On sequential decoding for the Gilbert channel.

[BibT_eX]

[DOI]

Vladimir Sidorenko

Kamil Sh. Zigangirov

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]

Kamil Sh. Zigangirov

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

Kamil Sh. Zigangirov

IEEE Trans. Inf. Theory, 1984

1979

On the distribution of computation for sequential decoding using the stack algorithm.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1979

1978

Further results on binary convolutional codes with an optimum distance profile (Corresp.).

[BibT_eX]

[DOI]

Erik Paaske

IEEE Trans. Inf. Theory, 1978

1977

On the error probability of general trellis codes with applications to sequential decoding (Corresp.).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1977

Some rate 1/3 and 1/4 binary convolutional codes with an optimum distance profile (Corresp.).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1977

1976

Some long rate one-half binary convolutional codes with an optimum distance profile (Corresp.).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1976

1975

Robustly optimal rate one-half binary convolutional codes (Corresp.).

[BibT_eX]

[DOI]