Abstract | ||
---|---|---|
In this paper we will discuss isometries and strong isometries for convolutional codes. Isometries are weight-preserving module isomorphisms whereas strong isometries are, in addition, degree-preserving. Special cases of these maps are certain types of monomial transformations. We will show a form of MacWilliams Equivalence Theorem, that is, each isometry between convolutional codes is given by a monomial transformation. Examples show that strong isometries cannot be characterized this way, but special attention paid to the weight adjacency matrices allows for further descriptions. Various distance parameters appearing in the literature on convolutional codes will be discussed as well. |
Year | DOI | Venue |
---|---|---|
2009 | 10.3934/amc.2009.3.179 | ADVANCES IN MATHEMATICS OF COMMUNICATIONS |
Keywords | Field | DocType |
Convolutional codes,strong isometries,state space realizations,weight adjacency matrix,monomial equivalence,MacWilliams Equivalence Theorem | Adjacency matrix,Discrete mathematics,Convolutional code,Isometry,Equivalence (measure theory),Isomorphism,Monomial,Mathematics | Journal |
Volume | Issue | ISSN |
3 | 2 | 1930-5346 |
Citations | PageRank | References |
1 | 0.37 | 9 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Heide Gluesing-Luerssen | 1 | 69 | 12.81 |