-
1
-
-
0017922440
-
Efficient maximum likelihood decoding of linear block codes using a trellis
-
Jan.
-
J. Wolf, "Efficient maximum likelihood decoding of linear block codes using a trellis," IEEE Trans. Inform. Theory, vol. IT-24, pp. 76-80, Jan. 1978.
-
(1978)
IEEE Trans. Inform. Theory
, vol.IT-24
, pp. 76-80
-
-
Wolf, J.1
-
2
-
-
0024078703
-
Minimal trellises for block codes
-
Sept.
-
D. J. Muder, "Minimal trellises for block codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1049-1053, Sept. 1988.
-
(1988)
IEEE Trans. Inform. Theory
, vol.34
, pp. 1049-1053
-
-
Muder, D.J.1
-
3
-
-
84941860379
-
Coset codes - Part II: Binary lattices and related codes
-
Sept.
-
G. D. Forney, Jr., "Coset codes - Part II: Binary lattices and related codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, Sept. 1988.
-
(1988)
IEEE Trans. Inform. Theory
, vol.34
, pp. 1152-1187
-
-
Forney Jr., G.D.1
-
4
-
-
0027659345
-
On structural complexity of the l-section minimal trellis diagrams for binary linear block codes
-
Sept.
-
T. Kasami, T. Takata, T. Fujiwara, and S. Lin, "On structural complexity of the l-section minimal trellis diagrams for binary linear block codes," IEICE Trans. Fundamentals, vol. E76-A, no. 9, pp. 1411-1421, Sept. 1993.
-
(1993)
IEICE Trans. Fundamentals
, vol.E76-A
, Issue.9
, pp. 1411-1421
-
-
Kasami, T.1
Takata, T.2
Fujiwara, T.3
Lin, S.4
-
5
-
-
0027596646
-
On complexity of trellis structure of linear block codes
-
May
-
_, "On complexity of trellis structure of linear block codes," IEEE Trans. Inform. Theory, vol. 39, pp. 1057-1064, May 1993.
-
(1993)
IEEE Trans. Inform. Theory
, vol.39
, pp. 1057-1064
-
-
-
6
-
-
0005183553
-
On branch labels of parallel components of the L-section minimal trellis diagrams for binary linear block codes
-
June
-
_, "On branch labels of parallel components of the L-section minimal trellis diagrams for binary linear block codes," IEICE Trans. Fundamentals, vol. E77-A, no. 6, pp. 1058-1068, June 1994.
-
(1994)
IEICE Trans. Fundamentals
, vol.E77-A
, Issue.6
, pp. 1058-1068
-
-
-
7
-
-
0028547151
-
Dimension/length profiles and trellis complexity of linear block codes
-
Nov.
-
G. D. Forney, Jr., "Dimension/length profiles and trellis complexity of linear block codes," IEEE Trans. Inform. Theory, vol. 40, pp. 1741-1752, Nov. 1994.
-
(1994)
IEEE Trans. Inform. Theory
, vol.40
, pp. 1741-1752
-
-
Forney Jr., G.D.1
-
8
-
-
0028388409
-
Maximum-likelihood soft decoding of BCH codes
-
Mar.
-
A. Vardy and Y. Be'ery, "Maximum-likelihood soft decoding of BCH codes," IEEE Trans. Inform. Theory, vol. 40, pp. 546-554, Mar. 1994.
-
(1994)
IEEE Trans. Inform. Theory
, vol.40
, pp. 546-554
-
-
Vardy, A.1
Be'ery, Y.2
-
9
-
-
0030150338
-
Optimum sectionalization of a trellis
-
May
-
A. Lafourcade and A. Vardy, "Optimum sectionalization of a trellis," IEEE Trans. Inform. Theory, vol. 42, pp. 689-702, May 1996.
-
(1996)
IEEE Trans. Inform. Theory
, vol.42
, pp. 689-702
-
-
Lafourcade, A.1
Vardy, A.2
-
10
-
-
0029369371
-
Average complexity evaluation of an MLD algorithm using the trellis structure for a linear block code
-
Sept.
-
H. Nagano, T. Fujiwara, and T. Kasami, "Average complexity evaluation of an MLD algorithm using the trellis structure for a linear block code," IEICE Trans. Fundamentals, vol. E78-A, no. 9, pp. 1209-1214, Sept. 1995.
-
(1995)
IEICE Trans. Fundamentals
, vol.E78-A
, Issue.9
, pp. 1209-1214
-
-
Nagano, H.1
Fujiwara, T.2
Kasami, T.3
-
11
-
-
0027257044
-
On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
-
Jan.
-
T. Kasami, T. Takata, T. Fujiwara, and S. Lin, "On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes," IEEE Trans. Inform. Theory, vol. 39, pp. 242-245, Jan. 1993.
-
(1993)
IEEE Trans. Inform. Theory
, vol.39
, pp. 242-245
-
-
Kasami, T.1
Takata, T.2
Fujiwara, T.3
Lin, S.4
-
12
-
-
33747090911
-
On the trellis structure of a (64, 40, 8) subcode of the (64, 42, 8) third-order Reed-Muller code
-
Rep. 95-001, Mar. 1
-
H. T. Moorthy, S. Lin, and G. T. Uehara, "On the trellis structure of a (64, 40, 8) subcode of the (64, 42, 8) third-order Reed-Muller code," NASA Rep., NAG 5-931, Rep. 95-001, Mar. 1, 1995.
-
(1995)
NASA Rep., NAG 5-931
-
-
Moorthy, H.T.1
Lin, S.2
Uehara, G.T.3
-
13
-
-
0009357811
-
VLSI architecture of a recursive maximum likelihood decoding algorithm for a (64, 35) subcode of the (64, 42) Reed-Muller code
-
Victoria, Canada, Sept.
-
T. Komura, M. Oka, T. Fujiwara, T. Onoye, T. Kasami, and S. Lin, "VLSI architecture of a recursive maximum likelihood decoding algorithm for a (64, 35) subcode of the (64, 42) Reed-Muller code," Proc. 1996 Int. Symp. Information Theory and Its Applications (Victoria, Canada, Sept. 1996), pp. 709-712.
-
(1996)
Proc. 1996 Int. Symp. Information Theory and Its Applications
, pp. 709-712
-
-
Komura, T.1
Oka, M.2
Fujiwara, T.3
Onoye, T.4
Kasami, T.5
Lin, S.6
-
14
-
-
0027668419
-
Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes
-
Sept.
-
Y. S. Han, C. R. P. Hartman, and C.-C. Chen, "Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes," IEEE Trans. Inform. Theory, vol. 39, pp. 1514-1523, Sept. 1993.
-
(1993)
IEEE Trans. Inform. Theory
, vol.39
, pp. 1514-1523
-
-
Han, Y.S.1
Hartman, C.R.P.2
Chen, C.-C.3
-
18
-
-
33747096184
-
A recursive MLD algorithm for some transitive invariant binary block codes
-
submitted for publication
-
T. Kasami, H. Tokushige, T. Fujiwara, H. Yamamoto, and S. Lin, "A recursive MLD algorithm for some transitive invariant binary block codes," IEICE Trans. Fundamentals, submitted for publication, 1997.
-
(1997)
IEICE Trans. Fundamentals
-
-
Kasami, T.1
Tokushige, H.2
Fujiwara, T.3
Yamamoto, H.4
Lin, S.5
|