# Secure communication over Trellis: Graph theoretic approach

##### References

809 citations

### "Secure communication over Trellis: ..." refers background or methods in this paper

...Such a cut-set S containing exactly one branch of a tree T and remaining branches from G is called a fundamental cutset with respect to T [14]....

[...]

...Spanning Trees A tree T is said to be a spanning tree of a connected graph G if T is sub graph of G and T contains all vertices of G [14]....

[...]

..., bk } is a fundamental circuit with respect to T [14]....

[...]

...Following theorems 1 and 2 [14] are useful in achieving security over fundamental cut-set and fundamental circuit, which are extended to trellis in the proposed method to provide security feature over trellis....

[...]

643 citations

612 citations

### "Secure communication over Trellis: ..." refers background in this paper

...Further, Wolf [8] showed the possibility of decoding of linear binary block codes constructed by...

[...]

...Further, Wolf [8] showed the possibility of decoding of linear binary block codes constructed by Bahl et. al. using Viterbi algorithm....

[...]

238 citations

### "Secure communication over Trellis: ..." refers methods in this paper

...The properties such as Observability, Controllability and minimal trellises for codes have been studied with emphasis on Algebra and Graph theory as well [9] [6] [10]....

[...]

200 citations

### "Secure communication over Trellis: ..." refers background or methods in this paper

...Kschischang and Sorokine defined [6], Trellis for a block code C of length n is an edge labeled directed graph with a distinguished ”root” vertex having in-degree zero and a distinguished ”goal” vertex having out-degree zero, and with the following properties: 1) all vertices can be reached from the root; 2) the goal can be reached from all vertices; 3) the number of edges traversed in passing from the root to the goal along any path is n; and 4) the set of n-tuples obtained by ’reading off’ the edge labels encountered in traversing all paths from the root to the goal is C....

[...]

...Forney introduced ’Trellis’ to represent linear block codes [6]....

[...]

...The properties such as Observability, Controllability and minimal trellises for codes have been studied with emphasis on Algebra and Graph theory as well [9] [6] [10]....

[...]