-
1
-
-
0027297425
-
"Near Shannon limit error-correcting coding and decoding: Turbo codes"
-
Geneva, Switzerland
-
C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo codes," in Proc. Int. Conf. Communications, vol. 2, Geneva, Switzerland, 1993, pp. 1064-1070.
-
(1993)
Proc. Int. Conf. Communications
, vol.2
, pp. 1064-1070
-
-
Berrou, C.1
Glavieux, A.2
Thitimajshima, P.3
-
2
-
-
0032072269
-
"Serial concatenation of interleaved codes: Performance analysis, design and iterative decoding"
-
May
-
S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Serial concatenation of interleaved codes: Performance analysis, design and iterative decoding," IEEE Trans. Inform. Theory, vol. 44, pp. 909-926, May 1998.
-
(1998)
IEEE Trans. Inform. Theory
, vol.44
, pp. 909-926
-
-
Benedetto, S.1
Divsalar, D.2
Montorsi, G.3
Pollara, F.4
-
3
-
-
0035333909
-
"Computing the free distance of turbo codes and serially concatenated codes with interleavers: Algorithms and applications"
-
May
-
R. Garello, P. Pierleoni, and S. Benedetto, "Computing the free distance of turbo codes and serially concatenated codes with interleavers: Algorithms and applications," IEEE J. Select. Areas Commun., vol. 19, pp. 800-812, May 2001.
-
(2001)
IEEE J. Select. Areas Commun.
, vol.19
, pp. 800-812
-
-
Garello, R.1
Pierleoni, P.2
Benedetto, S.3
-
4
-
-
0002203214
-
"Weight distributions for turbo codes using random and nonrandom permutations"
-
April-June, 122
-
S. Dolinar and D. Divsalar, "Weight distributions for turbo codes using random and nonrandom permutations," in TDA Progr. Rep., vol. 42-122, April-June 1995, pp. 56-65.
-
(1995)
TDA Progr. Rep.
, vol.42
, pp. 56-65
-
-
Dolinar, S.1
Divsalar, D.2
-
5
-
-
0035277379
-
"Turbo-encoder design for symbol-interleaved parallel concatenated trellis-coded modulation"
-
Mar
-
C. Fragouli and R. D. Wesel, "Turbo-encoder design for symbol-interleaved parallel concatenated trellis-coded modulation," IEEE Trans. Commun., vol. 49, pp. 425-435, Mar. 2001.
-
(2001)
IEEE Trans. Commun.
, vol.49
, pp. 425-435
-
-
Fragouli, C.1
Wesel, R.D.2
-
6
-
-
0036279329
-
"On the construction of turbo code interleavers based on graphs with large girth"
-
New York
-
P. O. Vontobel, "On the construction of turbo code interleavers based on graphs with large girth," in Proc. Int. Conf. Communications, New York, 2002, pp. 1408-1412.
-
(2002)
Proc. Int. Conf. Communications
, pp. 1408-1412
-
-
Vontobel, P.O.1
-
7
-
-
3943091916
-
"A logarithmic upper bound on the minimum distance of turbo codes"
-
Aug
-
M. Breiling, "A logarithmic upper bound on the minimum distance of turbo codes," IEEE Trans. Inform. Theory, vol. 50, pp. 1692-1710, Aug. 2004.
-
(2004)
IEEE Trans. Inform. Theory
, vol.50
, pp. 1692-1710
-
-
Breiling, M.1
-
8
-
-
0035771260
-
"Some results concerning design and decoding of turbo-codes"
-
July-Sept
-
D. Truhachev, M. Lentmaier, and K. S. Zigangirov, "Some results concerning design and decoding of turbo-codes," Probl. Inform. Transm., vol. 37, no. 3, pp. 190-205, July-Sept. 2001.
-
(2001)
Probl. Inform. Transm.
, vol.37
, Issue.3
, pp. 190-205
-
-
Truhachev, D.1
Lentmaier, M.2
Zigangirov, K.S.3
-
9
-
-
0030106621
-
"Unveiling turbo codes: Some results on parallel concatenated coding schemes"
-
Mar
-
S. Benedetto and G. Montorsi, "Unveiling turbo codes: Some results on parallel concatenated coding schemes," IEEE Trans. Inform. Theory vol. 42, pp. 409-428, Mar. 1996.
-
(1996)
IEEE Trans. Inform. Theory
, vol.42
, pp. 409-428
-
-
Benedetto, S.1
Montorsi, G.2
-
10
-
-
0035334169
-
"Upper bound on the minimum distance of turbo codes"
-
May
-
M. Breiling and J. B. Huber, "Upper bound on the minimum distance of turbo codes," IEEE Trans. Commun., vol. 49, pp. 808-815, May 2001.
-
(2001)
IEEE Trans. Commun.
, vol.49
, pp. 808-815
-
-
Breiling, M.1
Huber, J.B.2
-
11
-
-
0035504695
-
"Combinatorial analysis of the minimum distance of turbo codes"
-
Nov
-
M. Breiling and J. B. Huber, "Combinatorial analysis of the minimum distance of turbo codes," IEEE Trans. Inform. Theory, vol. 47, pp. 2737-2750, Nov. 2001.
-
(2001)
IEEE Trans. Inform. Theory
, vol.47
, pp. 2737-2750
-
-
Breiling, M.1
Huber, J.B.2
-
12
-
-
84888035174
-
"On the minimum distance of parallel and serially concatenated codes"
-
Available [Online]: submitted for publication
-
N. Kahale and R. Urbanke, "On the minimum distance of parallel and serially concatenated codes," IEEE Trans. Inform. Theory. Available [Online]: http://lthcwww.epfl.ch/~ruediger/papers/weight.ps, submitted for publication.
-
IEEE Trans. Inform. Theory
-
-
Kahale, N.1
Urbanke, R.2
-
13
-
-
5044251726
-
The minimum distance of turbo-like codes
-
[Online]. Available
-
L. Bazzi, M. Mahdian, and D. Spielman. The minimum distance of turbo-like codes. [Online]. Available: http://www-math.mit.edu/~mahdian/tc3.ps
-
-
-
Bazzi, L.1
Mahdian, M.2
Spielman, D.3
-
15
-
-
0018530717
-
"A connection between block and convolutional codes"
-
Oct
-
G. Solomon and H. van Tilborg, "A connection between block and convolutional codes," SIAM J. Appl. Math., vol. 37, pp. 358-369, Oct. 1979.
-
(1979)
SIAM J. Appl. Math.
, vol.37
, pp. 358-369
-
-
Solomon, G.1
van Tilborg, H.2
-
16
-
-
84938945707
-
"The advantages of non-binary turbo codes"
-
Cairns, Australia
-
C. Berrou, M. Jézéquel, C. Douillard, and S. Keroué dan, "The advantages of non-binary turbo codes," in Proc. Int. Information Theory Workshop, Cairns, Australia, 2001, pp. 61-63.
-
(2001)
Proc. Int. Information Theory Workshop
, pp. 61-63
-
-
Berrou, C.1
Jézéquel, M.2
Douillard, C.3
Kerouédan, S.4
-
17
-
-
0003268053
-
"Constructions for cubic graphs with large girth"
-
N. L. Biggs, "Constructions for cubic graphs with large girth," Electron. J. Combin., vol. 5, 1998.
-
(1998)
Electron. J. Combin.
, vol.5
-
-
Biggs, N.L.1
|