Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/8215
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Spasov, Dejan | en_US |
dc.date.accessioned | 2020-05-21T08:05:04Z | - |
dc.date.available | 2020-05-21T08:05:04Z | - |
dc.date.issued | 2020-05-08 | - |
dc.identifier.uri | http://hdl.handle.net/20.500.12188/8215 | - |
dc.description.abstract | In this paper we propose a generalization of the convolutional codes. The proposed generalization of the convolutional codes offers the possibility to discover previously unknow convolutional codes. For example, convolutional codes with pseudo-random time-varying trellis diagram that may improve error-correcting capabilities of the convolutional codes. An important property of the proposed generalization of the convolutional codes is that the decoding complexity remains the same as the decoding complexity of the ordinary convolutional codes. We propose encoding and decoding schemes for the generalized convolutional codes. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Ss Cyril and Methodius University in Skopje, Faculty of Computer Science and Engineering, Republic of North Macedonia | en_US |
dc.relation.ispartofseries | CIIT 2020 full papers;27 | - |
dc.subject | error-correcting codes, convolutional codes, turbo codes, LTE, 5G | en_US |
dc.title | A Generalization of the Convolutional Codes | en_US |
dc.type | Proceeding article | en_US |
dc.relation.conference | 17th International Conference on Informatics and Information Technologies - CIIT 2020 | en_US |
item.grantfulltext | open | - |
item.fulltext | With Fulltext | - |
crisitem.author.dept | Faculty of Computer Science and Engineering | - |
Appears in Collections: | International Conference on Informatics and Information Technologies |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
CIIT2020_paper_27.pdf | 292.62 kB | Adobe PDF | View/Open |
Page view(s)
147
checked on May 3, 2024
Download(s)
46
checked on May 3, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.