Low state complexity block codes via convolutional codes
Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
Dokumenttyp: Artikel i tidskrift
Förlag: IEEE--Institute of Electrical and Electronics Engineers Inc.
A new class of block codes with low state complexity of their conventional trellis representations called double zero-tail terminated convolutional codes (DZT codes) is introduced. It is shown that there exist DZT-codes meeting the Varshamov-Gilbert bound on the minimum distance and having asymptotically optimal state complexity. Two ways of constructing DZT-codes are considered. Examples of DZT-codes meeting a lower bound on the state complexity are given.
- Electrical Engineering, Electronic Engineering, Information Engineering
- tailbiting (TB)
- conventional trellis
- block codes
- double zero-tail terminated
- minimal trellis
- convolutional codes (DZT codes)
- ISSN: 0018-9448