Journal article
Quasi-cyclic unit memory convolutional codes
Unit memory convolutional codes with generator matrices, which are composed of circulant submatrices, are introduced. This structure facilitates the analysis of efficient search for good codes. Equivalences among such codes and some of the basic structural properties are discussed. In particular, catastrophic encoders and minimal encoders are characterized and dual codes treated.
Further, various distance measures are discussed, and a number of good codes, some of which result from efficient computer search and some of which result from known block codes, are presented
| Language: | English |
|---|---|
| Publisher: | IEEE |
| Year: | 1990 |
| Pages: | 540-547 |
| ISSN: | 15579654 and 00189448 |
| Types: | Journal article |
| DOI: | 10.1109/18.54876 |
Block codes Circuit theory Convolutional codes Delay Encoding Information theory Polynomials Telecommunications block codes catastrophic encoders circulant submatrices codes convolutional codes distance measures dual codes efficient computer search encoding generator matrices minimal encoders quasi-cyclic codes structural properties unit memory codes
