Ralf Koetter, Alexander Vardy  Home/Search
Context Related
| uiuc.edu/~koetter/publications...tbt.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uiuc.edu/~koetter/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Basic structural properties of tail-biting trellises are investigated. We start with rigorous definitions of various types of minimality for tail-biting trellises. (Update)
Similar documents based on text: More All
1.6: On Viewing Block Codes as Finite Automata - Shankar, Dasgupta, Deshmukh, Rajan (2001) (Correct)
1.1: Minimal Tail-Biting Trellises for Certain Cyclic Block .. - Shankar, Kumar.. (2001) (Correct)
1.0: Sequential Decoding of Tailbiting Convolutional Codes for Packet.. - Orten (1999) (Correct)
BibTeX entry: (Update)
R. Koetter and A. Vardy, "The structure of tail-biting trellises: minimality and basic principles," preprint, March 2002. http://citeseer.ist.psu.edu/koetter02structure.html More
@misc{ koetter02structure,
author = "R. Koetter and A. Vardy",
title = "The structure of tail-biting trellises: minimality and basic principles",
month = "March",
year = "2002",
url = "citeseer.ist.psu.edu/koetter02structure.html" }
Citations (may not include all citations):860 The Theory of Error Correcting Codes (context) - MacWilliams, Sloane - 1977
717 Theory of Linear and Integer Programming (context) - Schrijver - 1986
142 Factor graphs and the sum-product algorithm - Kschischang, Frey et al. - 2001
55 Codes and iterative decoding on general graphs (context) - Wiberg, Loeliger et al. - 1995
54 New York: Springer-Verlag (context) - Conway, Sloane et al. - 1988
33 Codes on graphs: Normal realizations (context) - Forney - 2001
32 Minimal trellises for block codes (context) - Muder - 1988
25 the BCJR trellis for linear block codes (context) - McEliece - 1996
21 Tail-biting MAP decoders (context) - Anderson, Hladik - 1998
21 the trellis structure of block codes - Kschischang, Sorokine - 1995
20 Minimal tail-biting trellises: the Golay code and more (context) - Calderbank, Forney et al. - 1999
10 On tail-biting convolutional codes (context) - Ma, Wolf - 1986
9 Lower bounds on trellis complexity of block codes (context) - Lafourcade, Vardy - 1995
8 Bit-level soft-decision decoding of Reed-Solomon codes (context) - Vardy, Be'ery - 1991
8 Construction of minimal tail-biting trellises (context) - Koetter, Vardy - 1998
[Article contains additional citations not shown here]
Documents on the same site (http://www.comm.csl.uiuc.edu/~koetter/publications.html): More
On fixed input distributions for noncoherent communication .. - Chen, Hajek, Koetter (2002) (Correct)
On the Representation of Codes in Forney Graphs - Koetter (2000) (Correct)
Algebraic Soft-Decision Decoding of Reed-Solomon Codes - Koetter, Vardy (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC