Minimal and canonical rational generator matrices for convolutional codes (Q3129473)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1004601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal and canonical rational generator matrices for convolutional codes |
scientific article; zbMATH DE number 1004601 |
Statements
Minimal and canonical rational generator matrices for convolutional codes (English)
0 references
12 June 1997
0 references
generator matrices
0 references
convolutional codes
0 references
encoder
0 references
predictable degree property
0 references
minimality
0 references
canonicality
0 references
predictable valuation property
0 references
valuation theory
0 references
0.8010798692703247
0 references
0.789130449295044
0 references
The authors review and extend known properties of generator matrices for convolutional codes. In the past a lot of papers were devoted to showing under which conditions a polynomial generator matrix is minimal (i.e. using as few memory elements as possible for an encoder for the code) or canonical (i.e. a generator matrix that has a minimal realisation in a controller canonical form). These properties are tied up with the so-called predictable degree property. Later on these results were generalised to rational generator matrices, however the generalisations were not completely correct and no proofs were given. The present paper tries to complete and to correct the suggested generalisations. The properties of minimality and canonicality are connected with the so-called predictable valuation property which is a natural generalisation of the predictable degree property. Also some other concepts of valuation theory are used and discussed.
0 references