Journal Papers
[J84] Iterative Decoding of Tail-Biting Trellises and Connections with Symbolic Dynamics
G. D. Forney Jr., F. R. Kschischang, B. Marcus, and S. Tuncel, in
Codes, Systems, and Graphical Models,
ser. IMA Volumes in Mathematics and its Applications, B. Marcus and J. Rosenthal, Eds., vol. 123, Springer Verlag, 2000, pp. 239–264. doi:
10.1007/978-1-4613-0165-3_13
[J94] The Trellis Structure of Maximal Fixed-Cost Codes
F. R. Kschischang,
IEEE Trans. Info. Theory,
vol. 42, pp. 1828–1838, Nov. 1996. doi:
10.1109/18.556678
[J95] Proof of a Conjecture of McEliece Regarding the Expansion Index of the Minimal Trellis
A. Vardy and F. R. Kschischang,
IEEE Trans. Info. Theory,
vol. 42, pp. 2027–2034, Nov. 1996. doi:
10.1109/18.556699
[J96] On the Intractability of Permuting a Block Code to Minimize Trellis Complexity
G. B. Horn and F. R. Kschischang,
IEEE Trans. Info. Theory,
vol. 42, pp. 2042–2048, Nov. 1996. doi:
10.1109/18.556701
[J97] Non-minimal Trellises for Linear Block Codes
R. C.-K. Lee and F. R. Kschischang,
Lecture Notes in Computer Science,
vol. 1133, pp. 111–129, 1996. doi:
10.1007/BFb0025140
[J99] On the Trellis Structure of Block Codes
F. R. Kschischang and V. Sorokine,
IEEE Trans. Info. Theory,
vol. 41, pp. 1924–1937, Nov. 1995. doi:
10.1109/18.476317
[J101] Trellis-Based Decoding of Binary Linear Block Codes
V. Sorokine, F. R. Kschischang, and V. Durand,
Lecture Notes in Computer Science,
vol. 793, pp. 270–286, 1994. doi:
10.1007/3-540-57936-2_44Conference Papers
[C28] Trellis Detection for Random Lattices
F. A. Monteiro and F. R. Kschischang, in
Proc. 8th Int. Symp. Wireless Commun. Sys,
Nov. 2011, pp. 755–759. doi:
10.1109/ISWCS.2011.6125450
[C133] Block Codes with Biproper Trellises
F. R. Kschischang, in
Proc. IEEE Int. Symp. on Information Theory and its Applications,
Victoria, BC, Sep. 1996, pp. 696–699.
[C134] Speeding up Turbo-decoding by Trellis Splicing
B. J. Frey, F. R. Kschischang, and P. G. Gulak, in
Proc. Int. Workshop on Turbo Codes,
Lund, Sweden, Aug. 1996.
[C136] Rectangular Codes and Biproper Trellises
F. R. Kschischang, in
Proc. 18th Biennial Symp. Commun.,
Queen’s University, Kingston, ON, Jun. 1996.
[C138] Design of Good Linear Block Codes with Fixed State Complexity
S. Zhang and F. R. Kschischang, in
Proc. 18th Biennial Symp. Commun.,
Queen’s University, Kingston, ON, Jun. 1996.
[C143] The Trellis Structure of Maximal Fixed-Cost Codes
F. R. Kschischang, in
Proc. IEEE Int. Symp. on Info. Theory,
Whistler, BC, Sep. 17, 1995–Sep. 22, 1995, p. 122. doi:
10.1109/ISIT.1995.531326
[C144] Applications of Nonminimal Block Code Trellises
F. R. Kschischang and R. C.-K. Lee, in
Proc. 4th Canadian Workshop on Information Theory,
Ville du Lac Delage, QC, May 28, 1995–May 31, 1995.
[C146] A Heuristic for Ordering a Linear Block Code to Minimize Trellis State Complexity
F. R. Kschischang and G. B. Horn, in
Proc. 32nd Annual Allerton Conf. on Commun., Control and Computing,
Allerton House, Monticello, IL, Sep. 28, 1994–Sep. 30, 1994, pp. 75–84.
[C147] On the Trellis Structure of Block Codes
F. R. Kschischang and V. Sorokine, in
Proc. IEEE Int. Symp. on Info. Theory,
Trondheim, Norway, Jun. 27, 1994–Jul. 1, 1994, p. 337. doi:
10.1109/ISIT.1994.394681
[C150] The Combinatorics of Block Code Trellises
F. R. Kschischang, in
Proc. 17th Biennial Symp. Commun.,
Queen’s University, Kingston, ON, May 1994.
[C151] Trellis-Based Decoding of Binary Linear Block Codes
V. Sorokine and F. R. Kschischang, in
Proc. 3rd Canadian Workshop on Information Theory,
Rockland, ON, May 30, 1993–Jun. 2, 1993, p. 6.
Updated: Mon Jan 20 17:05:07 EST 2020