5 citations found. Retrieving documents...
G.D. Forney, Jr., "Final report on a coding system design for advanced solar missions, " Contract NAS2--3637, NASA Ames Research Center, CA, December 1967.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Computational Methods in Coding Theory - Trachtenberg (1996)   (Correct)

....earliest vector in the same coset as v so that, by the discussion at the beginning of this proof, the method acts as claimed. 2 4.2. 2 Trellis Oriented The Viterbi algorithm was invented for the purpose of fast decoding of convolutional codes and also linear block codes [2] Forney [16] introduced trellises to simplify the Viterbi algorithm. In addition, as we can see in [33] the number of edges and vertices in a trellis determine the decoding complexity of the Viterbi algorithm, and the BCJR trellis [2] minimizes this decoding complexity. We can modify Method 4.2.1 to ....

G.D. Forney, Jr., "Final report on a coding system design for advanced solar missions," Contract NAS2--3637, NASA Ames Research Center, Moffet Field, CA, December 1967.


Lexicographic Codes: Constructions Bounds, and Trellis.. - Trachtenberg, Vardy   (Correct)

....return the lexicographically earliest This method is similar to the greedy algorithm for finding a minimal span generator matrix presented in [9, p.32] The proof of correctness and time bound for this method is detailed in [11, Chapter 4] 4. Trellis oriented lexicodes The trellis originated [5] in the study of finite state automata, and was conceived as a means to better explains the inner workings of the Viterbi algorithm for decoding convolutional codes. In 1974, Bahl, Cocke, Jelinek, and Raviv [1] observed that, just like convolutional codes, block codes can be also represented by a ....

G.D. Forney, Jr., "Final report on a coding system design for advanced solar missions," Contract NAS2-- 3637, NASA Ames Research Center, Moffet Field, CA, December 1967.


Ordered Binary Decision Diagrams and Minimal Trellises - Lafferty, Vardy (1998)   (1 citation)  (Correct)

....of ideas between them. One of our goals in this paper is to make the two research communities aware of each other. Prior to this result, the historical development of ideas surrounding OBDDs and trellises was independent, yet remarkably parallel. In coding, trellises were introduced by Forney [30], and first used to represent and decode block codes by Bahl, Cocke, Jelinek, and Raviv [5] However, the subject remained dormant until the publication of [34, 63] in 1988, that ignited a flurry of research during the past decade. To date, the study of trellises for block codes encompasses a ....

....As a consequence, the verification can be efficiently carried out using a recursive graph traversal algorithm. For more details on this and many other applications of OBDDs, we refer the reader to the survey by Bryant [16] 3. Minimal trellises for block codes Trellises were introduced by Forney [30] in 1967 as a conceptual means to explain the inner workings of the Viterbi algorithm [32] for decoding convolutional codes. IBM researchers Bahl, Cocke, Jelinek, and Raviv [5] were the first to observe that linear block codes may be also represented by a trellis, and showed how to construct such ....

G.D. Forney, Jr., "Final report on a coding system design for advanced solar missions, " Contract NAS2--3637, NASA Ames Research Center, CA, December 1967.


On the Representation of Codes in Forney Graphs - Koetter (2000)   Self-citation (Forney)   (Correct)

.... Other notable contributions to the area of codes on graphs are the work of Tanner [2] Wiberg et al. 3, 4] and a number of papers exploring the interplay between iterative decoding and other graph based algorithms [5, 6, 7, 8, 9] Trellis representations of codes were introduced by Forney [10] in order to explain the workings of the Viterbi algorithm. However it soon became clear that the representation of codes in trellis like structures is a discipline that provides much insight into the structure of the underlying code itself. Questions about minimal realizations and canonical ....

G.D. Forney, \Final report on a coding system design for advanced solar missions", Contract NAS2-3637, NASA Ames Research Center, CA, Dec. 1967.


Ordered Binary Decision Diagrams - And Minimal Trellises   (Correct)

No context found.

G.D. Forney, Jr., "Final report on a coding system design for advanced solar missions, " Contract NAS2--3637, NASA Ames Research Center, CA, December 1967.

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