The following pages link to Rolf Johannesson (Q1168368):
Displayed 50 items.
- (Q376107) (redirect page) (← links)
- Dual convolutional codes and the MacWilliams identities (Q376109) (← links)
- (Q676732) (redirect page) (← links)
- State spaces of convolutional codes (Q676733) (← links)
- Low-complexity error correction of Hamming-code-based LDPC codes (Q734298) (← links)
- Woven convolutional graph codes with large free distances (Q764245) (← links)
- Generalized unit-memory convolutional concatenated codes (Q1091349) (← links)
- On computing logarithms over GF(2**p) (Q1168369) (← links)
- Nonequivalent cascaded convolutional codes obtained from equivalent constituent convolutional encoders (Q1290829) (← links)
- Maximum distance separable convolutional codes (Q1304763) (← links)
- A trellis coding scheme based on signal alphabet splitting (Q1310720) (← links)
- On the theory of list decoding of convolutional codes (Q1389273) (← links)
- Asymptotic distance properties of binary woven convolutional codes (Q1569278) (← links)
- Detecting and correcting capabilities of convolutional codes (Q1776202) (← links)
- Topics in coding theory. In honour of Lars H. Zetterberg (Q1801300) (← links)
- Encoder and distance properties of woven convolutional codes with one tailbiting component code (Q1812341) (← links)
- A note on systematic tailbiting encoders (Q1812344) (← links)
- Distance approach to window decoding (Q1812354) (← links)
- A distance measure tailored to tailbiting codes (Q1812369) (← links)
- On Viterbi-like algorithms and their application to Reed-Muller codes (Q1827580) (← links)
- Codes with forbidden distances (Q1970693) (← links)
- Searching for Binary and Nonbinary Block and Convolutional LDPC Codes (Q2977044) (← links)
- Minimal and canonical rational generator matrices for convolutional codes (Q3129473) (← links)
- A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes (Corresp.) (Q3218063) (← links)
- On the distribution of the number of computations in any finite number of subtrees for the stack algorithm (Corresp.) (Q3347779) (← links)
- A fast algorithm for computing distance spectrum of convolutional codes (Q3470415) (← links)
- A BEAST for Prowling in Trees (Q3546580) (← links)
- BEAST Decoding of Block Codes Obtained Via Convolutional Codes (Q3546581) (← links)
- Low State Complexity Block Codes Via Convolutional Codes (Q3546582) (← links)
- On Error Exponents for Woven Convolutional Codes With One Tailbiting Component Code (Q3546982) (← links)
- Woven Convolutional Codes II: Decoding Aspects (Q3547076) (← links)
- On Nested Convolutional Codes and Their Application to Woven Codes (Q3547077) (← links)
- Unequal error protection for convolutional codes (Q3547479) (← links)
- Trellis Complexity of Short Linear Codes (Q3548252) (← links)
- An Improved Bound on the List Error Probability and List Distance Properties (Q3604427) (← links)
- Soft-Output BEAST Decoding With Application to Product Codes (Q3604527) (← links)
- Robustly optimal rate one-half binary convolutional codes (Corresp.) (Q4060862) (← links)
- Some long rate one-half binary convolutional codes with an optimum distance profile (Corresp.) (Q4103433) (← links)
- Some rate 1/3 and 1/4 binary convolutional codes with an optimum distance profile (Corresp.) (Q4133526) (← links)
- On the error probability of general trellis codes with applications to sequential decoding (Corresp.) (Q4141098) (← links)
- Further results on binary convolutional codes with an optimum distance profile (Corresp.) (Q4159285) (← links)
- On the distribution of computation for sequential decoding using the stack algorithm (Q4178923) (← links)
- (Q4256362) (← links)
- A linear algebra approach to minimal convolutional encoders (Q4307325) (← links)
- Systematic feed-forward convolutional encoders are better than other encoders with an M-algorithm decoder (Q4400301) (← links)
- Some structural properties of convolutional codes over rings (Q4400303) (← links)
- (Q4460809) (← links)
- (Q4501001) (← links)
- A note on type II convolutional codes (Q4501737) (← links)
- Optimal and near-optimal encoders for short and moderate-length tail-biting trellises (Q4503450) (← links)