937 resultados para MDP codes
Resumo:
In this paper we use some classical ideas from linear systems theory to analyse convolutional codes. In particular, we exploit input-state-output representations of periodic linear systems to study periodically time-varying convolutional codes. In this preliminary work we focus on the column distance of these codes and derive explicit necessary and sufficient conditions for an (n, 2, 1) periodically time-varying convolutional code to have Maximum Distance Profile (MDP).
Resumo:
National Highway Traffic Safety Administration, Washington, D.C.
Resumo:
Cover title.
Resumo:
Mode of access: Internet.
Resumo:
National Highway Traffic Safety Administration, Office of Research and Development, Washington, D.C.
Resumo:
Mode of access: Internet.
Resumo:
"August 1970."
Resumo:
Mode of access: Internet.
Resumo:
"April 1990"--P. iii.
Resumo:
Mode of access: Internet.
Resumo:
Mode of access: Internet.
Resumo:
Mode of access: Internet.
Resumo:
"ISR code no. 4013"--T.p. verso.
Resumo:
"Greg J. Duncan and James N. Morgan are the principal researchers."
Resumo:
This paper revisits strongly-MDS convolutional codes with maximum distance profile (MDP). These are (non-binary) convolutional codes that have an optimum sequence of column distances and attains the generalized Singleton bound at the earliest possible time frame. These properties make these convolutional codes applicable over the erasure channel, since they are able to correct a large number of erasures per time interval. The existence of these codes have been shown only for some specific cases. This paper shows by construction the existence of convolutional codes that are both strongly-MDS and MDP for all choices of parameters.