Rolf Johannesson
Titel
Professor
Organisation
046-2227517
Rolf [dot] Johannesson [at] eit [dot] lth [dot] se
Publikationer (hämtat ur Lunds universitets publikationsdatabas)
författare
- 2012
- A Closed Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes
- A Closed-Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes
- A Greedy Search for Improved QC LDPC Codes with Good Girth Profile and Degree Distribution
- A note on duality and MacWilliams-type identities for convolutional codes
- Dual convolutional codes and the MacWilliams identities
- High-Rate QC LDPC Codes of Short and Moderate Length with Good Girth Profile
- Searching for voltage graph-based LDPC tailbiting codes with large girth
- 2011
- Another look at the exact bit error probability for Viterbi decoding of convolutional codes
- Double-Hamming based QC LDPC codes with large minimum distance
- LDPC codes with large girth based on voltage graphs
- On the exact bit error probability for Viterbi decoding of convolutional codes
- Some Voltage Graph-Based LDPC Tailbiting Codes with Large Girth
- Woven convolutional graph codes with large free distances
- 2010
- 2009
- 2008
- An improved bound on the list error probability and list distance properties
- Asymptotic performance of woven graph codes
- On the Asymptotic Performance of Low-Complexity Decoded LDPC Codes with Constituent Hamming Codes
- On the Erasure-Correcting Capabilities of Low-Complexity Decoded LDPC Codes with Constituent Hamming Codes
- On the Error-Correcting Capabilities of Low-Complexity Decoded LDPC Codes with Constituent Hamming Codes
- On the Expanding Properties of Gallager's LDPC Matrices
- Soft-output BEAST decoding with application to product Codes
- Woven graph codes over hypergraphs
- 2007
- 2006
- 2005
- Achieving unequal error protection via woven codes: Construction and analysis
- BEAST decoding - asymptotic complexity
- BEAST decoding of block codes obtained via convolutional codes
- Estimating the list size for BEAST-APP decoding
- Understanding Information Transmission
- Unequal error protection explained by state-transition graphs
- Woven constructions for multi-level information protection
- 2004
- A BEAST for prowling in trees
- A new look at the error-correcting capabilities of convolutional codes
- An atypical approach to carrier modulation
- BEAST decoding for block codes
- BEAST decoding for block codes
- Detecting and correcting capabilities of convolutional codes
- Low state complexity block codes via convolutional codes
- Nested convolutional codes and their application to woven codes
- On APP-decoding using BEAST
- On error exponents for woven convolutional codes with one tailbiting component code
- On unequal error protection for code symbols via active distances
- On unequal error protection for information symbols via active distances
- Woven convolutional codes II: Decoding aspects
- 2003
- A new look at Shannon bandwidth
- Boosting the error performance of suboptimal tailbiting decoders
- Low state complexity block codes via convolutional codes
- On the burst error detecting and erasure correcting capabilities of convolutional codes
- On the error detecting and erasure correcting capabilities of convolutional codes
- Tailbiting convolutional codes
- 2002
- A Note on Systematic Tailbiting Encoders
- A distance approach to window decoding
- A distance measure tailored to tailbiting codes
- A note on tailbiting codes and their feedback encoders
- Convolutional codes with large slopes yield better tailbiting codes
- Encoder and distance properties of woven convolutional codes with one tailbiting component code
- How to efficiently find the minimum distance of tailbiting codes
- On nested convolutional codes
- On tennis trellises, state-transition diagrams, Carl Nielsen and Jim Massey
- On the error correcting capability of convolutional codes: Old and new
- Soft-output-decoding: Some aspects from information theory
- Systematic bits are better and no buts about it
- Tailbiting codes obtained via convolutional codes with large active distance-slopes
- Tailbiting codes: Bounds and search results
- Trellis representations for quasi-cyclic codes
- Woven convolutional codes I: Encoder properties
- 2001
- An upper bound on decoding bit-error probability with linear coding on extremely noisy channels
- Information processing in soft-output decoding
- On interleaver design for serially concatenated convolutional codes
- On the error exponent for woven convolutional codes with inner warp
- Prowling with a BEAST
- Some distance properties of tailbiting codes
- 2000
- A note on Type II covolutional codes
- Decoding of woven convolutional codes and simulation results
- On the decoding bit error probability for binary convolutional codes
- On woven convolutional codes
- Rudified convolutional encoders
- Searching for tailbiting codes with large minimum distances
- Systematic bits are better
- Systematic bits are better also for tailbiting codes
- Systematic bits are better and no buts about it
- Tailbiting: a bridge between block and convolutional codes
- The effect of the tailbiting restriction on feedback encoders
- Woven convolutional codes with tailbiting
- 1999
- Active distances for convolutional codes
- Asymptotic distance properties of binary woven convolutional codes
- Fundamentals of convolutional coding
- New rate 1/2, 1/3, and 1/4 binary convolutional encoders with an optimum distance profile
- On the error exponent for woven convolutional codes with outer warps
- Optimal and near-optimal encoders for short and moderate-length tailbiting trellises
- Woven convolutional codes: encoder properties and error exponents
- 1998
- A condition for feedback tailbiting convolutional encoders and a short list of allowed feedback polynomials
- Cascaded convolutional codes
- Convolutional codes, encoders, and syndrome formers: old and new
- Decoding of woven convolutional codes with outer warp - preliminary results
- Generator matrices of binary woven convolutional codes
- New tailbiting encoders
- Nonequivalent cascaded convolutional codes obtained from equivalent constituent convolutional encoders
- Nonequivalent cascaded convolutional codes obtained from equivalent constituent convolutional encoders
- On the error exponent for woven convolutional codes with outer warp
- Recent results on tailbiting encoders
- Rudified convolutional encoders
- Some structural properties of convolutional codes over rings
- Systematic feed-forward convolutional encoders are better than other encoders with an M-algorithm decoder
- Two 16-state, rate R=2/4 trellis codes whose free distances meet the Heller bound
- Woven convolutional codes and their generator matrices
- 1997
- 1996
- Active distances for convolutional codes
- An expurgation upper bound on the probability of corret path loss for time-invariant convolutional codes
- Convolutional codes over rings
- Minimal and canonical rational generator matrices for convolutional codes
- Minimal and canonical rational generator matrices for convolutional codes
- On the theory of list decoding of convolutional codes
- Two 16-state, rate R=2/4 trellis codes whose free distance meet the Heller bound
- 1995
- Bounds on the number of computations of sequential decoding for the Gilbert-Elliott channel
- Claude E. Shannon (in Swedish)
- Cryptology (in Swedish)
- Decoding procedure capacities for the Gilbert-Elliott channel
- Information theory (in Swedish)
- Lower bounds on the free distance for random concatenated convolutional codes
- On the construction of concatenated codes based on binary conventional convolutional codes
- On the error probability for list decoding of convolutional codes
- Upper bounds on the probability of the correct path loss for list decoding of fixed convolutional codes
- 1994
- A generalization of the predictable degree property to rational convolutional encoding matrices
- List decoding of convolutional codes - a Tutorial
- New results on estimations of the burst and bit error probabilities for fixed convolutional codes
- On canonical encoding matrices and the generalized constraint lengths of convolutional codes
- 1993
- A linear algebra approach to minimal convolutional encoders
- Creeper - an algorithm for sequential decoding
- Different minimality criteria for rational convolutional encoders
- Efficient splitting of multidimensional alphabets for modulation codes
- Estimating some important parameters for the Gilbert-Elliott channel using a sequential decoder
- Strengthening Viterbi's upper bound on the bit error probability for maximum likelihood decoding of fixed binary convolutional codes
- Systematic feed-forward convolutional encoders are as good as other encoders with an M-algorithm decoder
- 1992
- 1991
- A linear algebra approach to minimal convolutional encoders
- Estimating the computational cut-off rate for the Gilbert-Elliott channel
- Estimating the computational cut-off rate for the Gilbert-Elliott channel
- Strengthening Simmon's bound on impersonation
- Strengthening Simmons' bound on impersonation
- Submodules of Fx^n and convolutional codes
- 1990
- 1989
- 1988
- 1987
- 1986
- 1985
- 1984
- 1983
- 1982
- 1981
- 1979
- 1978
- 1977
- 1976
- 1975
- 1974
- 1973
