4-Sets-Cut-Decoding algorithms for random codes based on quasigroups
The decoding speed is the biggest problem of random codes based on quasigroups proposed elsewhere. These codes are a combination of cryptographic algorithms and error-correcting codes. In our previous paper we proposed Cut-Decoding algorithm which is 4.5 times faster than the original one for code (...
Uloženo v:
| Vydáno v: | International journal of electronics and communications Ročník 69; číslo 10; s. 1417 - 1428 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier GmbH
01.10.2015
|
| Témata: | |
| ISSN: | 1434-8411, 1618-0399 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The decoding speed is the biggest problem of random codes based on quasigroups proposed elsewhere. These codes are a combination of cryptographic algorithms and error-correcting codes. In our previous paper we proposed Cut-Decoding algorithm which is 4.5 times faster than the original one for code (72,288). In this paper, four new modifications (so-called 4-Sets-Cut-Decoding algorithms) of this algorithm are proposed in order to obtain an improvement of the decoding speed. We present and analyze several experimental results obtained with different algorithms for random codes based on quasigroups. It is shown that using new algorithms, improvement of the efficiency and decoding speed is obtained. Also, we derive the upper bound for packet-error probability obtained with Cut-Decoding and 4-Sets-Cut-Decoding algorithm. At the end, some methods for reducing the number of unsuccessful decodings in the new proposed algorithms are considered. |
|---|---|
| AbstractList | The decoding speed is the biggest problem of random codes based on quasigroups proposed elsewhere. These codes are a combination of cryptographic algorithms and error-correcting codes. In our previous paper we proposed Cut-Decoding algorithm which is 4.5 times faster than the original one for code (72,288). In this paper, four new modifications (so-called 4-Sets-Cut-Decoding algorithms) of this algorithm are proposed in order to obtain an improvement of the decoding speed. We present and analyze several experimental results obtained with different algorithms for random codes based on quasigroups. It is shown that using new algorithms, improvement of the efficiency and decoding speed is obtained. Also, we derive the upper bound for packet-error probability obtained with Cut-Decoding and 4-Sets-Cut-Decoding algorithm. At the end, some methods for reducing the number of unsuccessful decodings in the new proposed algorithms are considered. |
| Author | Popovska-Mitrovikj, Aleksandra Markovski, Smile Bakeva, Verica |
| Author_xml | – sequence: 1 givenname: Aleksandra surname: Popovska-Mitrovikj fullname: Popovska-Mitrovikj, Aleksandra email: aleksandra.popovska.mitrovikj@finki.ukim.mk – sequence: 2 givenname: Smile surname: Markovski fullname: Markovski, Smile email: smile.markovski@finki.ukim.mk – sequence: 3 givenname: Verica surname: Bakeva fullname: Bakeva, Verica email: verica.bakeva@finki.ukim.mk |
| BookMark | eNp9kMtOwzAQRS1UJErhB1jlBxzGieOkEhvU8pIqsQDW1sSeFFdtXGwHib8nVVmx6GpGGp3RveeSTXrfE2M3AnIBQt1ucqSB8gJElYPKQcAZmwolGg7lfD4Zd1lK3kghLthljBuAAupCTdlS8jdKkS-GxJdkvHX9OsPt2geXPncx63zIAvbW77LxSDFrMZLNfJ99DRjdOvhhH6_YeYfbSNd_c8Y-Hh_eF8989fr0srhfcSMlJN5hZRHqhoQ10jaqrNV8Tkrauq2sVRJRYg1IhBW2SkCLjRlDFqjQlkVN5Yw1x78m-BgDddq4hMn5PgV0Wy1AH2zojT7Y0AcbGpQebYxo8Q_dB7fD8HMaujtCNJb6dhR0NI56Q9YFMklb707hv1Tbe-I |
| CitedBy_id | crossref_primary_10_1109_ACCESS_2023_3278051 crossref_primary_10_1049_iet_com_2018_5636 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier GmbH |
| Copyright_xml | – notice: 2015 Elsevier GmbH |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.aeue.2015.06.010 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1618-0399 |
| EndPage | 1428 |
| ExternalDocumentID | 10_1016_j_aeue_2015_06_010 S1434841115001818 |
| GroupedDBID | --K --M .~1 0R~ 1B1 1~. 1~5 23M 3V. 4.4 457 4G. 5GY 5VS 7-5 71M 8FE 8FG 8FW 8P~ 8R4 8R5 AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABAOU ABBOA ABFNM ABLJU ABMAC ABUWG ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKRA AFKWA AFTJW AGHFR AGUBO AGYEJ AHJVU AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARAPS ARUGR ASPBG AVWKF AXJTR AZFZN BENPR BGLVJ BJAXD BKOJK BLXMC BPHCQ CAG CCPQU COF CS3 DWQXO EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F0J FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HCIFZ HVGLF HZ~ IHE J1W JJJVA KOM M1Q M41 MHUIS MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P62 PC. PQQKQ PROAC Q2X Q38 R2- RIG ROL RPZ S0X SDF SDG SES SEW SPC SST SSV SSW SSZ T5K ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFFHD AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU CITATION EFKBS PHGZM PHGZT PQGLB ~HD |
| ID | FETCH-LOGICAL-c440t-fa5da078e1dc4d8637699e64d7b5dd64aa4a70aeea5ab610ba8c7262a6ad327e3 |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000361167000004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1434-8411 |
| IngestDate | Tue Nov 18 21:55:20 EST 2025 Sat Nov 29 06:24:37 EST 2025 Fri Feb 23 02:34:31 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 10 |
| Keywords | 94A05 Crypt-coding 94B35 20N05 Packet-error probability Quasigroup 68P30 94B60 Random code Bit-error probability Error-correcting code |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c440t-fa5da078e1dc4d8637699e64d7b5dd64aa4a70aeea5ab610ba8c7262a6ad327e3 |
| PageCount | 12 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_aeue_2015_06_010 crossref_primary_10_1016_j_aeue_2015_06_010 elsevier_sciencedirect_doi_10_1016_j_aeue_2015_06_010 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-10-01 |
| PublicationDateYYYYMMDD | 2015-10-01 |
| PublicationDate_xml | – month: 10 year: 2015 text: 2015-10-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | International journal of electronics and communications |
| PublicationYear | 2015 |
| Publisher | Elsevier GmbH |
| Publisher_xml | – name: Elsevier GmbH |
| References | Zivic, Ruland (bib0010) 2010; 4 Gligoroski, Markovski, Kocarev (bib0035) 2007 Popovska-Mitrovikj, Markovski, Bakeva (bib0030) 2012 Gligoroski, Markovski, Kocarev (bib0020) 2007 Mathur, Narayan, Subbalakshmi (bib0015) 2006 Markovski, Gligoroski, Bakeva (bib0040) 1999 Popovska-Mitrovikj, Markovski, Bakeva (bib0025) 2009 Tzonelih, Rao (bib0005) 1990 Gligoroski (10.1016/j.aeue.2015.06.010_bib0020) 2007 Popovska-Mitrovikj (10.1016/j.aeue.2015.06.010_bib0030) 2012 Mathur (10.1016/j.aeue.2015.06.010_bib0015) 2006 Markovski (10.1016/j.aeue.2015.06.010_bib0040) 1999 Tzonelih (10.1016/j.aeue.2015.06.010_bib0005) 1990 Zivic (10.1016/j.aeue.2015.06.010_bib0010) 2010; 4 Gligoroski (10.1016/j.aeue.2015.06.010_bib0035) 2007 Popovska-Mitrovikj (10.1016/j.aeue.2015.06.010_bib0025) 2009 |
| References_xml | – start-page: 165 year: 2007 end-page: 172 ident: bib0020 article-title: Error-correcting codes based on quasigroups publication-title: Proceedings of the 16th international conference on computer communications and networks (ICCCN 2007) – start-page: 540 year: 1990 end-page: 563 ident: bib0005 article-title: Secret error-correcting codes publication-title: Advances in cryptology – CRYPTO '88, LNCS 403 – start-page: 446 year: 2007 end-page: 451 ident: bib0035 article-title: Totally asynchronous stream ciphers + redundancy = cryptcoding. publication-title: Proceedings of the 2007 international conference on security and management, SAM 2007 – start-page: 93 year: 2012 end-page: 102 ident: bib0030 article-title: Increasing the decoding speed of random codes based on quasigroups publication-title: Web proceedings of ICT innovations 2012 – start-page: 13 year: 1999 end-page: 28 ident: bib0040 article-title: Quasigroup string processing: Part 1 publication-title: Maced Acad Sci Arts Sect Math Tech Sci – start-page: 377 year: 2009 end-page: 389 ident: bib0025 article-title: Performances of error-correcting codes based on quasigroups publication-title: ICT-innovations 2009 – volume: 4 start-page: 140 year: 2010 end-page: 144 ident: bib0010 article-title: Parallel joint channel coding and cryptography publication-title: Int J Electr Electron Eng – start-page: 309 year: 2006 end-page: 324 ident: bib0015 article-title: High diffusion cipher: encryption and error correction in a single cryptographic primitive publication-title: Applied cryptography and network security 2006, LNCS 3989 – start-page: 540 year: 1990 ident: 10.1016/j.aeue.2015.06.010_bib0005 article-title: Secret error-correcting codes – start-page: 13 issue: 1–2 year: 1999 ident: 10.1016/j.aeue.2015.06.010_bib0040 article-title: Quasigroup string processing: Part 1 publication-title: Maced Acad Sci Arts Sect Math Tech Sci – volume: 4 start-page: 140 issue: 2 year: 2010 ident: 10.1016/j.aeue.2015.06.010_bib0010 article-title: Parallel joint channel coding and cryptography publication-title: Int J Electr Electron Eng – start-page: 165 year: 2007 ident: 10.1016/j.aeue.2015.06.010_bib0020 article-title: Error-correcting codes based on quasigroups – start-page: 377 year: 2009 ident: 10.1016/j.aeue.2015.06.010_bib0025 article-title: Performances of error-correcting codes based on quasigroups – start-page: 446 year: 2007 ident: 10.1016/j.aeue.2015.06.010_bib0035 article-title: Totally asynchronous stream ciphers + redundancy = cryptcoding. – start-page: 309 year: 2006 ident: 10.1016/j.aeue.2015.06.010_bib0015 article-title: High diffusion cipher: encryption and error correction in a single cryptographic primitive – start-page: 93 year: 2012 ident: 10.1016/j.aeue.2015.06.010_bib0030 article-title: Increasing the decoding speed of random codes based on quasigroups |
| SSID | ssj0020726 |
| Score | 2.0935013 |
| Snippet | The decoding speed is the biggest problem of random codes based on quasigroups proposed elsewhere. These codes are a combination of cryptographic algorithms... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 1417 |
| SubjectTerms | Bit-error probability Crypt-coding Error-correcting code Packet-error probability Quasigroup Random code |
| Title | 4-Sets-Cut-Decoding algorithms for random codes based on quasigroups |
| URI | https://dx.doi.org/10.1016/j.aeue.2015.06.010 |
| Volume | 69 |
| WOSCitedRecordID | wos000361167000004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1618-0399 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0020726 issn: 1434-8411 databaseCode: AIEXJ dateStart: 20010101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3JbtswECUMp4f2UHRF0w069Gaw0EJqOQZJijZIggBJC9-EsUi3sh3JtWQjX5LvzXDRksANkkMvgiCIlM154DwO5w0J-RJyT3roeSgXDBco8ZRR4Coi5k5c9L6AlF_XmT2OTk_j8Tg5GwyuGy3MZhEVRXx1lSz_q6nxGRpbSWcfYe62U3yA92h0vKLZ8fogwzN6LuuK7q9reoBrSy1agcXvcpXXf0z1hRH6J1FejpScvRopPybUnsHfNVS5VnlUfcp6O2bYqzTRnaBTNeq4TmvSUvWzclluqjnQk7xW4Yv5zOpq5hU2WrVeQYmG1Is6u-D8Ml902_2AY6A57i-9u9QPVHi8TXlr5lYWMBozO7faydec09KAzO1NpR4zok7rllVluK1Tvok-zL6CXKuypx7X9VhtV7fqa9_xe202YpPoNktVH6nqI1XZfkq5t-NHPImHZGfvx-H4qF3Ku5FvdGv2L1k5lskcvPtLtlOeHo25eEGe2_WHs2dw85IMZPGKPOtVpXxNDrYgyOkQ5CCCHIMgRyPI0QhyysLpIegN-fnt8GL_O7WHbdCMMbemU-ACkC9KT2RMxCE6niSRIRPRhAsRMgAGkQtSAocJcu4JxBkOgg8hiMCPZPCWDIuykO-Ik2RTPwg8Ab5EvpgFEGVMcr0WFjJK5C7xmvFIM1uJXh2Iskj_bYldMmrbLE0dlnvf5s0wp5ZJGoaYImruaff-UV_5QJ52OP9IhvVqLT-RJ9mmzqvVZwuZG4QelrE |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=4-Sets-Cut-Decoding+algorithms+for+random+codes+based+on+quasigroups&rft.jtitle=International+journal+of+electronics+and+communications&rft.au=Popovska-Mitrovikj%2C+Aleksandra&rft.au=Markovski%2C+Smile&rft.au=Bakeva%2C+Verica&rft.date=2015-10-01&rft.issn=1434-8411&rft.volume=69&rft.issue=10&rft.spage=1417&rft.epage=1428&rft_id=info:doi/10.1016%2Fj.aeue.2015.06.010&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_aeue_2015_06_010 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1434-8411&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1434-8411&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1434-8411&client=summon |