| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 602 1 |
| Ultima descărcare din IBN: 2019-06-05 15:31 |
| Căutarea după subiecte similare conform CZU |
| 004.416.2+519.1 (1) |
| Programe. Software (295) |
| Analiză combinatorică. Teoria grafurilor (114) |
 SM ISO690:2012RABEFIHAVANANA, L., ANDRIATAHINY, H., RABEHERIMANANA, T.. Error correcting codes from sub-exceeding functions. In: Computer Science Journal of Moldova, 2019, nr. 1(79), pp. 34-55. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
  Computer Science Journal of Moldova |
||||||
| Numărul 1(79) / 2019 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 004.416.2+519.1 | ||||||
| Pag. 34-55 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
In this paper, we present linear systematic error-correcting codes Lk and L+ k which are the results of our research on the sub-exceeding functions. Given an integer k such that k ≥ 3, these two codes are respectively [2k, k] and [3k, k] linear codes. The minimum distance of L3 is 3 and for k ≥ 4 the minimum distance of Lk is 4. The code L+ k , the minimum distances are respectively 5 and 6 for k = 4 and k ≥ 5. By calculating the complexity of the algorithms, our codes have fast and efficient decoding. Then, for a short and medium distance data transmission (wifi network, bluetooth, cable, ...), we see that the codes mentioned above present many advantages. |
||||||
| Cuvinte-cheie Error correction code, encoding, decoding, subexceeding function |
||||||
|
Cerif XML Export
<?xml version='1.0' encoding='utf-8'?> <CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'> <cfResPubl> <cfResPublId>ibn-ResPubl-78368</cfResPublId> <cfResPublDate>2019-05-29</cfResPublDate> <cfVol>79</cfVol> <cfIssue>1</cfIssue> <cfStartPage>34</cfStartPage> <cfISSN>1561-4042</cfISSN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/78368</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>Error correcting codes from sub-exceeding functions</cfTitle> <cfKeyw cfLangCode='EN' cfTrans='o'>Error correction code; encoding; decoding; subexceeding function</cfKeyw> <cfAbstr cfLangCode='EN' cfTrans='o'><p>In this paper, we present linear systematic error-correcting codes Lk and L+ k which are the results of our research on the sub-exceeding functions. Given an integer k such that k ≥ 3, these two codes are respectively [2k, k] and [3k, k] linear codes. The minimum distance of L3 is 3 and for k ≥ 4 the minimum distance of Lk is 4. The code L+ k , the minimum distances are respectively 5 and 6 for k = 4 and k ≥ 5. By calculating the complexity of the algorithms, our codes have fast and efficient decoding. Then, for a short and medium distance data transmission (wifi network, bluetooth, cable, ...), we see that the codes mentioned above present many advantages.</p></cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2019-05-29T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2019-05-29T24:00:00</cfStartDate> </cfResPubl_Class> <cfPers_ResPubl> <cfPersId>ibn-person-63389</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2019-05-29T24:00:00</cfStartDate> </cfPers_ResPubl> <cfPers_ResPubl> <cfPersId>ibn-person-63390</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2019-05-29T24:00:00</cfStartDate> </cfPers_ResPubl> <cfPers_ResPubl> <cfPersId>ibn-person-63391</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2019-05-29T24:00:00</cfStartDate> </cfPers_ResPubl> </cfResPubl> <cfPers> <cfPersId>ibn-Pers-63389</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-63389-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2019-05-29T24:00:00</cfStartDate> <cfFamilyNames>Rabefihavanana</cfFamilyNames> <cfFirstNames>L.</cfFirstNames> </cfPersName_Pers> </cfPers> <cfPers> <cfPersId>ibn-Pers-63390</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-63390-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2019-05-29T24:00:00</cfStartDate> <cfFamilyNames>Andriatahiny</cfFamilyNames> <cfFirstNames>H.</cfFirstNames> </cfPersName_Pers> </cfPers> <cfPers> <cfPersId>ibn-Pers-63391</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-63391-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2019-05-29T24:00:00</cfStartDate> <cfFamilyNames>Rabeherimanana</cfFamilyNames> <cfFirstNames>T.</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>
|
|
|
