2008 |
32 | EE | Irina E. Bocharova,
Rolf Johannesson,
Boris D. Kudryashov,
Victor V. Zyablov:
Woven Graph Codes: Asymptotic Performances and Examples
CoRR abs/0804.0996: (2008) |
31 | EE | Irina E. Bocharova,
Rolf Johannesson,
Boris D. Kudryashov,
Maja Loncar:
An Improved Bound on the List Error Probability and List Distance Properties.
IEEE Transactions on Information Theory 54(1): 13-32 (2008) |
30 | EE | Maja Loncar,
Rolf Johannesson,
Irina E. Bocharova,
Boris D. Kudryashov:
Soft-Output BEAST Decoding With Application to Product Codes.
IEEE Transactions on Information Theory 54(3): 1036-1049 (2008) |
2007 |
29 | EE | Irina E. Bocharova,
Rolf Johannesson,
Boris D. Kudryashov:
Trellis Complexity of Short Linear Codes.
IEEE Transactions on Information Theory 53(1): 361-368 (2007) |
2006 |
28 | EE | V. Pavlushkov,
Rolf Johannesson,
Victor V. Zyablov:
Unequal error protection for convolutional codes.
IEEE Transactions on Information Theory 52(2): 700-708 (2006) |
2005 |
27 | EE | Irina E. Bocharova,
Marc Handlery,
Rolf Johannesson,
Boris D. Kudryashov:
BEAST decoding of block codes obtained via convolutional codes.
IEEE Transactions on Information Theory 51(5): 1880-1891 (2005) |
2004 |
26 | | Ralph Jordan,
Stefan Höst,
Rolf Johannesson,
Martin Bossert,
Victor V. Zyablov:
Woven convolutional codes. II: decoding aspects.
IEEE Transactions on Information Theory 50(10): 2522-2531 (2004) |
25 | | Ralph Jordan,
Rolf Johannesson,
Martin Bossert:
On nested convolutional codes and their application to woven codes.
IEEE Transactions on Information Theory 50(2): 380-384 (2004) |
24 | | Irina E. Bocharova,
Marc Handlery,
Rolf Johannesson,
Boris D. Kudryashov:
A BEAST for Prowling in Trees.
IEEE Transactions on Information Theory 50(6): 1295-1302 (2004) |
23 | | Marc Handlery,
Rolf Johannesson,
Victor V. Zyablov:
On Error Exponents for Woven Convolutional Codes With One Tailbiting Component Code.
IEEE Transactions on Information Theory 50(8): 1809-1811 (2004) |
22 | | Irina E. Bocharova,
Rolf Johannesson,
Boris D. Kudryashov:
Low State Complexity Block Codes Via Convolutional Codes.
IEEE Transactions on Information Theory 50(9): 2022-2030 (2004) |
2002 |
21 | | Irina E. Bocharova,
Rolf Johannesson,
Boris D. Kudryashov,
Per Ståhl:
Tailbiting codes: Bounds and search results.
IEEE Transactions on Information Theory 48(1): 137-148 (2002) |
20 | | Stefan Höst,
Rolf Johannesson,
Victor V. Zyablov:
Woven convolutional codes I: Encoder properties.
IEEE Transactions on Information Theory 48(1): 149-161 (2002) |
19 | | Per Ståhl,
John B. Anderson,
Rolf Johannesson:
A note on tailbiting codes and their feedback encoders.
IEEE Transactions on Information Theory 48(2): 529-534 (2002) |
18 | | Irina E. Bocharova,
Marc Handlery,
Rolf Johannesson,
Boris D. Kudryashov:
Tailbiting codes obtained via convolutional codes with large active distance-slopes.
IEEE Transactions on Information Theory 48(9): 2577-2587 (2002) |
2001 |
17 | | Victor V. Zyablov,
Sergo Shavgulidze,
Rolf Johannesson:
On the error exponent for woven convolutional codes with inner warp.
IEEE Transactions on Information Theory 47(3): 1195-1199 (2001) |
2000 |
16 | | Rolf Johannesson,
Per Ståhl,
Emma Wittenmark:
A note on type II convolutional codes.
IEEE Transactions on Information Theory 46(4): 1510-1514 (2000) |
1999 |
15 | | Stefan Höst,
Rolf Johannesson,
Kamil Sh. Zigangirov,
Victor V. Zyablov:
Active Distances for Convolutional Codes.
IEEE Transactions on Information Theory 45(2): 658-669 (1999) |
14 | | Victor V. Zyablov,
Sergo Shavgulidze,
Oleg Skopintsev,
Stefan Höst,
Rolf Johannesson:
On the error exponent for woven convolutional codes with outer warp.
IEEE Transactions on Information Theory 45(5): 1649-1653 (1999) |
13 | | Rolf Johannesson,
Per Ståhl:
New rate 1/2, 1/3, and 1/4 binary convolutional encoders with an optimum distance profile.
IEEE Transactions on Information Theory 45(5): 1653-1658 (1999) |
12 | | Per Ståhl,
John B. Anderson,
Rolf Johannesson:
Optimal and near-optimal encoders for short and moderate-length tail-biting trellises.
IEEE Transactions on Information Theory 45(7): 2562-2571 (1999) |
1998 |
11 | | Harro Osthoff,
John B. Anderson,
Rolf Johannesson,
Chin-foo Lin:
Systematic Feed-Forward Convolutional Encoders Are Better than Other Encoders with an M-Algorithm Decoder.
IEEE Transactions on Information Theory 44(2): 831-838 (1998) |
10 | | Rolf Johannesson,
Zhe-xian Wan,
Emma Wittenmark:
Some Structural Properties of Convolutional Codes over Rings.
IEEE Transactions on Information Theory 44(2): 839-845 (1998) |
9 | | Rolf Johannesson,
Emma Wittenmark:
Two 16-State, Rate R = 2/4 Trellis Codes Whose Free Distances Meet the Heller Bound.
IEEE Transactions on Information Theory 44(4): 1602-1604 (1998) |
1996 |
8 | | G. David Forney Jr.,
Rolf Johannesson,
Zhe-xian Wan:
Minimal and canonical rational generator matrices for convolutional codes.
IEEE Transactions on Information Theory 42(6): 1865-1880 (1996) |
1995 |
7 | | Rolf Johannesson:
Review of 'Algebraic Methods for Signal Processing and Communications Coding' (Blahut, R.E.; 1991).
IEEE Transactions on Information Theory 41(3): 864- (1995) |
1993 |
6 | | Rolf Johannesson,
Zhe-xian Wan:
A linear algebra approach to minimal convolutional encoders.
IEEE Transactions on Information Theory 39(4): 1219-1233 (1993) |
1991 |
5 | | Rolf Johannesson,
Andrea Sgarro:
Strengthening Simmons' bound on impersonation.
IEEE Transactions on Information Theory 37(4): 1182- (1991) |
1989 |
4 | | Mats L. Cedervall,
Rolf Johannesson:
A fast algorithm for computing distance spectrum of convolutional codes.
IEEE Transactions on Information Theory 35(6): 1146-1159 (1989) |
1988 |
3 | | V. Sidorenko,
Rolf Johannesson,
Kamil Sh. Zigangirov:
On sequential decoding for the Gilbert channel.
IEEE Transactions on Information Theory 34(5): 1058- (1988) |
1985 |
2 | | Rolf Johannesson,
Kamil Sh. Zigangirov:
On the distribution of the number of computations in any finite number of subtrees for the stack algorithm.
IEEE Transactions on Information Theory 31(1): 100- (1985) |
1984 |
1 | | Mats L. Cedervall,
Rolf Johannesson,
Kamil Sh. Zigangirov:
A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes.
IEEE Transactions on Information Theory 30(5): 762- (1984) |