Rolf Johannesson

From MaRDI portal
Revision as of 15:54, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Rolf Johannesson to Rolf Johannesson: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1168368

Available identifiers

zbMath Open johannesson.rolfMaRDI QIDQ1168368

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q50901982022-07-18Paper
Woven Graph Codes: Asymptotic Performances and Examples2017-07-27Paper
A Rate $R=5/20$ Hypergraph-Based Woven Convolutional Code With Free Distance $120$2017-07-27Paper
A Closed-Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes2017-07-12Paper
Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth2017-07-12Paper
Searching for Binary and Nonbinary Block and Convolutional LDPC Codes2017-04-28Paper
Dual convolutional codes and the MacWilliams identities2013-11-04Paper
Woven convolutional graph codes with large free distances2012-03-13Paper
Low-complexity error correction of Hamming-code-based LDPC codes2009-10-20Paper
An Improved Bound on the List Error Probability and List Distance Properties2009-02-24Paper
Soft-Output BEAST Decoding With Application to Product Codes2009-02-24Paper
A BEAST for Prowling in Trees2008-12-21Paper
BEAST Decoding of Block Codes Obtained Via Convolutional Codes2008-12-21Paper
Low State Complexity Block Codes Via Convolutional Codes2008-12-21Paper
On Error Exponents for Woven Convolutional Codes With One Tailbiting Component Code2008-12-21Paper
Woven Convolutional Codes II: Decoding Aspects2008-12-21Paper
On Nested Convolutional Codes and Their Application to Woven Codes2008-12-21Paper
Unequal error protection for convolutional codes2008-12-21Paper
Trellis Complexity of Short Linear Codes2008-12-21Paper
Detecting and correcting capabilities of convolutional codes2005-05-23Paper
Tailbiting codes obtained via convolutional codes with large active distance-slopes2005-05-11Paper
https://portal.mardi4nfdi.de/entity/Q46646732005-04-08Paper
https://portal.mardi4nfdi.de/entity/Q44608092004-03-29Paper
Encoder and distance properties of woven convolutional codes with one tailbiting component code2004-01-08Paper
A distance measure tailored to tailbiting codes2003-10-12Paper
A note on systematic tailbiting encoders2003-06-19Paper
Distance approach to window decoding2003-06-19Paper
On the error exponent for woven convolutional codes with inner warp2002-08-04Paper
Tailbiting codes: bounds and search results2002-08-04Paper
Woven convolutional codes .I. Encoder properties2002-08-04Paper
A note on tailbiting codes and their feedback encoders2002-08-04Paper
A note on type II convolutional codes2000-09-07Paper
Optimal and near-optimal encoders for short and moderate-length tail-biting trellises2000-09-07Paper
https://portal.mardi4nfdi.de/entity/Q45010012000-09-03Paper
Asymptotic distance properties of binary woven convolutional codes2000-07-02Paper
https://portal.mardi4nfdi.de/entity/Q49450692000-01-01Paper
Two 16-state, rate R=2/4 trellis codes whose free distances meet the Heller bound1999-11-21Paper
Active distances for convolutional codes1999-11-21Paper
On the error exponent for woven convolutional codes with outer warp1999-11-21Paper
New rate 1/2, 1/3, and 1/4 binary convolutional encoders with an optimum distance profile1999-11-21Paper
https://portal.mardi4nfdi.de/entity/Q42563621999-07-11Paper
Nonequivalent cascaded convolutional codes obtained from equivalent constituent convolutional encoders1999-07-04Paper
Systematic feed-forward convolutional encoders are better than other encoders with an M-algorithm decoder1998-10-27Paper
Some structural properties of convolutional codes over rings1998-08-02Paper
On the theory of list decoding of convolutional codes1998-07-08Paper
Minimal and canonical rational generator matrices for convolutional codes1997-06-12Paper
https://portal.mardi4nfdi.de/entity/Q48572381996-10-07Paper
A linear algebra approach to minimal convolutional encoders1994-10-04Paper
A trellis coding scheme based on signal alphabet splitting1994-03-08Paper
Topics in coding theory. In honour of Lars H. Zetterberg1993-06-05Paper
A fast algorithm for computing distance spectrum of convolutional codes1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57492381989-01-01Paper
On the distribution of the number of computations in any finite number of subtrees for the stack algorithm (Corresp.)1985-01-01Paper
A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes (Corresp.)1984-01-01Paper
On computing logarithms over GF(2**p)1981-01-01Paper
On the distribution of computation for sequential decoding using the stack algorithm1979-01-01Paper
Further results on binary convolutional codes with an optimum distance profile (Corresp.)1978-01-01Paper
Some rate 1/3 and 1/4 binary convolutional codes with an optimum distance profile (Corresp.)1977-01-01Paper
On the error probability of general trellis codes with applications to sequential decoding (Corresp.)1977-01-01Paper
Some long rate one-half binary convolutional codes with an optimum distance profile (Corresp.)1976-01-01Paper
Robustly optimal rate one-half binary convolutional codes (Corresp.)1975-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Rolf Johannesson