Low state complexity block codes via convolutional codes
(2004) In IEEE Transactions on Information Theory 50(9). p.2022-2030- Abstract
- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/268547
- author
- Bocharova, Irina LU ; Johannesson, Rolf LU and Kudryashov, Boris LU
- organization
- publishing date
- 2004
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- tailbiting (TB), conventional trellis, block codes, double zero-tail terminated, minimal trellis, trellis, convolutional codes (DZT codes)
- in
- IEEE Transactions on Information Theory
- volume
- 50
- issue
- 9
- pages
- 2022 - 2030
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- external identifiers
-
- wos:000223579500011
- scopus:4544287752
- ISSN
- 0018-9448
- DOI
- 10.1109/TIT.2004.833342
- language
- English
- LU publication?
- yes
- id
- 64f5cce1-faf2-4733-8b2b-6cb3b5a0f66f (old id 268547)
- date added to LUP
- 2016-04-01 17:06:18
- date last changed
- 2022-01-29 00:23:01
@article{64f5cce1-faf2-4733-8b2b-6cb3b5a0f66f, abstract = {{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.}}, author = {{Bocharova, Irina and Johannesson, Rolf and Kudryashov, Boris}}, issn = {{0018-9448}}, keywords = {{tailbiting (TB); conventional trellis; block codes; double zero-tail terminated; minimal trellis; trellis; convolutional codes (DZT codes)}}, language = {{eng}}, number = {{9}}, pages = {{2022--2030}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, series = {{IEEE Transactions on Information Theory}}, title = {{Low state complexity block codes via convolutional codes}}, url = {{http://dx.doi.org/10.1109/TIT.2004.833342}}, doi = {{10.1109/TIT.2004.833342}}, volume = {{50}}, year = {{2004}}, }