| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 622 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 (296) |
| Analiză combinatorică. Teoria grafurilor (115) |
 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 |
||||||
|
DataCite XML Export
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'> <creators> <creator> <creatorName>Rabefihavanana, L.</creatorName> <affiliation>Université d'Antananarivo, Madagascar</affiliation> </creator> <creator> <creatorName>Andriatahiny, H.</creatorName> <affiliation>Université d'Antananarivo, Madagascar</affiliation> </creator> <creator> <creatorName>Rabeherimanana, T.</creatorName> <affiliation>Université d'Antananarivo, Madagascar</affiliation> </creator> </creators> <titles> <title xml:lang='en'>Error correcting codes from sub-exceeding functions</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2019</publicationYear> <relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1561-4042</relatedIdentifier> <subjects> <subject>Error correction code</subject> <subject>encoding</subject> <subject>decoding</subject> <subject>subexceeding function</subject> <subject schemeURI='http://udcdata.info/' subjectScheme='UDC'>004.416.2+519.1</subject> </subjects> <dates> <date dateType='Issued'>2019-05-29</date> </dates> <resourceType resourceTypeGeneral='Text'>Journal article</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'><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></description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>
|
|
|
