Name
Abstract | ||
|---|---|---|
We will study convolutional codes with the help of state space realizations. It will be shown that two such minimal realizations belong to the same code if and only if they are equivalent under the full state feedback group. This result will be used in order to prove that two codes with positive Forney indices are monomially equivalent if and only if they share the same adjacency matrix. The adjacency matrix is an invariant of the code obtained via a minimal state space realization and counts in a detailed way the weights of all possible outputs. It contains full information about the weights of the codewords in the given code. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.laa.2007.03.004 | Linear Algebra and its Applications |
Keywords | Field | DocType |
94B10,94B05,93B15,93B20 | Adjacency matrix,Discrete mathematics,Concatenated error correction code,Combinatorics,Convolutional code,Equivalence (measure theory),Linear code,Monomial,Minimal realization,State space,Mathematics | Journal |
Volume | Issue | ISSN |
425 | 2 | 0024-3795 |
Citations | PageRank | References |
6 | 0.51 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Heide Gluesing-Luerssen | 1 | 69 | 12.81 |
| Gert Schneider | 2 | 6 | 0.51 |