Ве молиме користете го овој идентификатор да го цитирате или поврзете овој запис:
http://hdl.handle.net/20.500.12188/23983
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Popovska-Mitrovikj, Aleksandra | en_US |
dc.contributor.author | Markovski, Smile | en_US |
dc.contributor.author | Bakeva, Verica | en_US |
dc.date.accessioned | 2022-10-31T12:31:09Z | - |
dc.date.available | 2022-10-31T12:31:09Z | - |
dc.date.issued | 2013-11-26 | - |
dc.identifier.uri | http://hdl.handle.net/20.500.12188/23983 | - |
dc.description.abstract | Error-correcting codes based on quasigroups are defined elsewhere. These codes are a combination of cryptographic algorithms and error correcting codes. In a paper of ours we succeed to improve the speed of the decoding process by defining new algorithm for coding and decoding, named “cut-decoding algorithm”. Here, a new modification of the cut-decoding algorithm is considered in order to obtain further improvements of the code performances. We present several experimental results obtained with different decoding algorithms for these codes. | en_US |
dc.publisher | IEEE | en_US |
dc.subject | bit-error probability, cryptcoding, errorcorrecting code, packet-error probability, quasigroup, quasigroup transformation, random code | en_US |
dc.title | Error-correcting codes with cryptographic algorithms | en_US |
dc.type | Proceedings | en_US |
dc.relation.conference | 2013 21st Telecommunications Forum Telfor (TELFOR) | en_US |
item.fulltext | With Fulltext | - |
item.grantfulltext | open | - |
crisitem.author.dept | Faculty of Computer Science and Engineering | - |
crisitem.author.dept | Faculty of Computer Science and Engineering | - |
Appears in Collections: | Faculty of Computer Science and Engineering: Conference papers |
Files in This Item:
File | Опис | Size | Format | |
---|---|---|---|---|
Error_correcting_codes_with_cryptographi.pdf | 284.81 kB | Adobe PDF | View/Open |
Записите во DSpace се заштитени со авторски права, со сите права задржани, освен ако не е поинаку наведено.