Artículos de revistas
Network Flow Approach To Convolutional Codes
Registro en:
Ieee Transactions On Communications. Ieee, Piscataway, Nj, United States, v. 43, n. 2 -4 pt 3, p. 1429 - 1440, 1995.
906778
10.1109/26.380193
2-s2.0-0029252004
Autor
Palazzo Jr. Reginaldo
Institución
Resumen
In this paper we present an alternative way of looking at convolutional codes as a network of flows. From this association, previous known classes of nonsystematic convolutional codes are reproduced. We also present a decomposition of the problem of finding good convolutional codes into well known and structured problems such as the maximum flow problem, the knapsack problem, and the modular representation of block codes. A spanning tree search algorithm is also proposed for finding good codes. We consider the class of nonsystematic convolutional codes for which the encoders satisfy an equivalent property related to the feasibility of flow. Finally, extensive tables show the new and the previous known codes. 43 2 -4 pt 3 1429 1440